The Library
Browse by Warwick Author
Up a level |
Number of items: 19.
2016
Adamczyk, Marek, Sviridenko, Maxim and Ward, Justin (2016) Submodular stochastic probing on matroids. Mathematics of Operations Research, 41 (3). pp. 1022-1038. doi:10.1287/moor.2015.0766 ISSN 0364-765X.
2015
Bienkowski, Marcin, Byrka, Jarosลaw, Chrobak, Marek, Dobbs, Neil, Nowicki, Tomasz, Sviridenko, Maxim, ลwirszcz, G. and Young, Neal E. (2015) Approximation algorithms for the joint replenishment problem with deadlines. Journal of Scheduling, 18 (6). pp. 545-560. doi:10.1007/s10951-014-0392-y ISSN 1094-6136.
2014
Adamczyk, Marek, Sviridenko, Maxim and Ward, Justin (2014) Submodular stochastic probing on matroids. In: STACS โ14: 31st International Symposium on Theoretical Aspects of Computer Science, Lyon, France, 5-8 Mar 2014. Published in: 31st International Symposium on Theoretical Aspects of Computer Science (STACS โ14) pp. 29-40. doi:10.4230/LIPIcs.STACS.2014.29
Pedrosa, Lehilton L. C. and Sviridenko, Maxim (2014) Integrated supply chain management via randomized rounding. In: LATIN 2014 : Theoretical Informatics :11th Latin American Symposium, Montevideo, Uruguay, March 31โApril 4, 2014. Proceedings. Lecture Notes in Computer Science, Volume 8392 . Springer, pp. 562-573. ISBN 9783642544224
2013
Sviridenko, Maxim and Wiese, Andreas (2013) Approximating the configuration-LP for minimizing weighted sum of completion times on unrelated machines. In: Goemans, Michel and Correa, Jose, (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, 7801 . Berlin Heidelberg: Springer-Verlag, pp. 387-398. ISBN 9783642366932
Bienkowski, M., Byrka, J., Chrobak, M., Dobbs, N., Nowicki, T., Sviridenko, Maxim , ลwirszcz, G. and Young, N. E. (2013) Approximation algorithms for the joint replenishment problem with deadlines. In: Freivalds, Rลซsiลลก and Kwiatkowska, Martha and Fomin, Fedor V. and Peleg , David, (eds.) Automata, Languages, and Programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Lecture Notes in Computer Science, Volume 7965 . Berlin ; London: Springer Berlin Heidelberg, pp. 135-147. ISBN 9783642392054
Ward, Justin and Sviridenko, Maxim (2013) Large neighborhood local search for the maximum set packing problem. In: Freiฬvalds, R. V. and Kwiatkowska, Martha and Fomin, Fedor V. and Peleg , D. (David), (eds.) Automata, Languages, and Programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Lecture Notes in Computer Science (7965). Berlin ; London: Springer, pp. 792-803. ISBN 9783642392054
Lee, Jon, Sviridenko, Maxim and Vondrรกk, Jan (2013) Matroid matching : the power of local search. SIAM Journal on Computing, Volume 42 (Number 1). pp. 357-379. doi:10.1137/11083232X ISSN 0097-5397.
Mucha, Marcin and Sviridenko, Maxim (2013) No-wait flowshop scheduling is as hard as asymmetric traveling salesman problem. In: Freivalds, Rลซsiลลก and Kwiatkowska, Martha and Fomin, Fedor V. and Peleg , David, (eds.) Automata, Languages, and Programming : 40th International Colloquium, ICALP 2013, Riga, Latvia, July 8-12, 2013, Proceedings, Part I. Lecture Notes in Computer Science, Volume 7965 . Berlin ; London: Springer Berlin Heidelberg, pp. 769-779. ISBN 9783642392054
Nonner, Tim and Sviridenko, Maxim (2013) An efficient polynomial-time approximation scheme for the joint replenishment problem. In: Goemans, Michel and Correa, Jose, (eds.) Integer Programming and Combinatorial Optimization. Lecture Notes in Computer Science, Volume 7801 . Berlin Heidelberg: Springer-Verlag, pp. 314-323. ISBN 9783642366932
2012
Baptiste, Ph., Carlier, J., Kononov, A., Queyranne, M., Sevastyanov, S. and Sviridenko, Maxim (2012) Integer preemptive scheduling on parallel machines. Operations Research Letters, Vol.40 (No.6). pp. 440-444. doi:10.1016/j.orl.2012.06.011 ISSN 0167-6377.
Saket, Rishi and Sviridenko, Maxim (2012) New and improved bounds for the minimum set cover problem. In: Gupta , Anupam and Jansen , Klaus and Rolim , Josรฉ and Servedio , Rocco , (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques : 15th International Workshop, APPROX 2012, and 16th International Workshop, RANDOM 2012, Cambridge, MA, USA, August 15-17, 2012. Proceedings. Lecture Notes in Computer Science, Volume 7408 . Berlin Heidelberg: Springer Netherlands, pp. 288-300. ISBN 9783642325113
2011
Fleischer, L., Goemans, M. X., Mirrokni, V. S. and Sviridenko, Maxim (2011) Tight Approximation Algorithms for Maximum Separable Assignment Problems. Mathematics of Operations Research, 36 (3). pp. 416-431. doi:10.1287/moor.1110.0499 ISSN 0364-765X.
2010
Bansal, Nikhil, Chen, Ning, Cherniavsky, Neva, Rurda, Atri, Schieber, Baruch and Sviridenko, Maxim (2010) Dynamic pricing for impatient bidders. ACM Transactions on Algorithms , Vol.6 (No.2). pp. 1-21. doi:10.1145/1721837.1721851 ISSN 1549-6325.
Lee, Jon, Mirrokni, Vahab S., Nagarajan, Viswanath and Sviridenko, Maxim (2010) Maximizing nonmonotone submodular functions under matroid or knapsack constraints. SIAM Journal on Discrete Mathematics, Vol.23 (No.4). pp. 2053-2078. doi:10.1137/090750020 ISSN 0895-4801.
Bansal, Nikhil, Caprara, Alberto and Sviridenko, Maxim (2010) A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing. SIAM Journal on Computing, 39 (4). pp. 1256-1278. doi:10.1137/080736831 ISSN 0097-5397.
2009
Lee, Jon, Mirrokni, Vahab S., Nagarajan, Viswanath and Sviridenko, Maxim (2009) Non-monotone submodular maximization under matroid and knapsack constraints. In: 41st ACM Symposium on Theory of Computing (STOC 2009), Bethesda, Maryland, 31 May - 2 Jun 2009. Published in: STOC '09 Proceedings of the 41st annual ACM symposium on Theory of computing p. 323. doi:10.1145/1536414.1536459 ISSN 978-1-60558-506-2.
Lee, Jon, Sviridenko, Maxim and Vondrรกk, Jan (2009) Submodular maximization over multiple matroids via generalized exchange properties. Lecture Notes in Computer Science, Vol.5687 . pp. 244-257. doi:10.1007/978-3-642-03685-9_19 ISSN 0302-9743.
2008
Bansal, Nikhil, Coppersmith, Don and Sviridenko, Maxim (2008) Improved Approximation Algorithms for Broadcast Scheduling. SIAM Journal on Computing, 38 (3). pp. 1157-1174. doi:10.1137/060674417 ISSN 0097-5397.
This list was generated on Fri Apr 19 18:37:49 2024 BST.