Moseley, Benjamin; Sviridenko, Maxim Submodular optimization with contention resolution extensions. (English) Zbl 07650070 Achlioptas, Dimitris (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques, 22nd international conference, APPROX 2019, and 23rd international conference, RANDOM 2019, Massachusetts Institute of Technology, Cambridge, MA, USA, September 20–22, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 145, Article 3, 17 p. (2019). MSC: 68W20 68W25 90C27 PDFBibTeX XMLCite \textit{B. Moseley} and \textit{M. Sviridenko}, LIPIcs -- Leibniz Int. Proc. Inform. 145, Article 3, 17 p. (2019; Zbl 07650070) Full Text: DOI
Pedrosa, Lehilton L. C.; Sviridenko, Maxim Integrated supply chain management via randomized rounding. (English) Zbl 1446.90044 INFORMS J. Comput. 30, No. 1, 124-136 (2018). MSC: 90B05 90B50 68W25 90B80 90C11 PDFBibTeX XMLCite \textit{L. L. C. Pedrosa} and \textit{M. Sviridenko}, INFORMS J. Comput. 30, No. 1, 124--136 (2018; Zbl 1446.90044) Full Text: DOI
Makarychev, Konstantin; Sviridenko, Maxim Solving optimization problems with diseconomies of scale via decoupling. (English) Zbl 1426.90261 J. ACM 65, No. 6, Article No. 42, 27 p. (2018). MSC: 90C59 68W25 90B35 90C27 PDFBibTeX XMLCite \textit{K. Makarychev} and \textit{M. Sviridenko}, J. ACM 65, No. 6, Article No. 42, 27 p. (2018; Zbl 1426.90261) Full Text: DOI
Makarychev, Konstantin; Sviridenko, Maxim Maximizing polynomials subject to assignment constraints. (English) Zbl 1451.68353 ACM Trans. Algorithms 13, No. 4, Article No. 54, 15 p. (2017). MSC: 68W25 90B80 90C27 90C59 PDFBibTeX XMLCite \textit{K. Makarychev} and \textit{M. Sviridenko}, ACM Trans. Algorithms 13, No. 4, Article No. 54, 15 p. (2017; Zbl 1451.68353) Full Text: DOI
Sviridenko, Maxim; Vondrák, Jan; Ward, Justin Optimal approximation for submodular and supermodular optimization with bounded curvature. (English) Zbl 1386.90129 Math. Oper. Res. 42, No. 4, 1197-1218 (2017). MSC: 90C27 68W25 PDFBibTeX XMLCite \textit{M. Sviridenko} et al., Math. Oper. Res. 42, No. 4, 1197--1218 (2017; Zbl 1386.90129) Full Text: DOI arXiv
Krishnaswamy, Ravishankar; Sviridenko, Maxim Inapproximability of the multilevel uncapacitated facility location problem. (English) Zbl 1446.68069 ACM Trans. Algorithms 13, No. 1, Article No. 1, 25 p. (2016). MSC: 68Q17 68W25 90B80 PDFBibTeX XMLCite \textit{R. Krishnaswamy} and \textit{M. Sviridenko}, ACM Trans. Algorithms 13, No. 1, Article No. 1, 25 p. (2016; Zbl 1446.68069) Full Text: DOI
Makarychev, Konstantin; Makarychev, Yury; Sviridenko, Maxim; Ward, Justin A bi-criteria approximation algorithm for \(k\)-means. (English) Zbl 1398.68680 Jansen, Klaus (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. Proceedings of the 19th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2016, and the 20th international workshop on randomization and computation, RANDOM 2016, Paris, France, September 7–9, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-018-7). LIPIcs – Leibniz International Proceedings in Informatics 60, Article 14, 20 p. (2016). MSC: 68W25 62H30 90C59 PDFBibTeX XMLCite \textit{K. Makarychev} et al., LIPIcs -- Leibniz Int. Proc. Inform. 60, Article 14, 20 p. (2016; Zbl 1398.68680) Full Text: DOI arXiv
Miyazawa, Flávio K.; Pedrosa, Lehilton L. C.; Schouery, Rafael C. S.; Sviridenko, Maxim; Wakabayashi, Yoshiko Polynomial-time approximation schemes for circle and other packing problems. (English) Zbl 1385.68053 Algorithmica 76, No. 2, 536-568 (2016). Reviewer: Roberto Solis-Oba (London) MSC: 68W25 90C27 90C59 PDFBibTeX XMLCite \textit{F. K. Miyazawa} et al., Algorithmica 76, No. 2, 536--568 (2016; Zbl 1385.68053) Full Text: DOI arXiv
Adamczyk, Marek; Sviridenko, Maxim; Ward, Justin Submodular stochastic probing on matroids. (English) Zbl 1342.90112 Math. Oper. Res. 41, No. 3, 1022-1038 (2016). MSC: 90C15 68W25 90C27 PDFBibTeX XMLCite \textit{M. Adamczyk} et al., Math. Oper. Res. 41, No. 3, 1022--1038 (2016; Zbl 1342.90112) Full Text: DOI arXiv Link
Skutella, Martin; Sviridenko, Maxim; Uetz, Marc Unrelated machine scheduling with stochastic processing times. (English) Zbl 1342.90072 Math. Oper. Res. 41, No. 3, 851-864 (2016). MSC: 90B36 68M20 90C27 90C59 68W25 68W40 68Q25 PDFBibTeX XMLCite \textit{M. Skutella} et al., Math. Oper. Res. 41, No. 3, 851--864 (2016; Zbl 1342.90072) Full Text: DOI Link
Mucha, Marcin; Sviridenko, Maxim No-wait flowshop scheduling Is as hard as asymmetric traveling salesman problem. (English) Zbl 1334.90054 Math. Oper. Res. 41, No. 1, 247-254 (2016). MSC: 90B35 68W25 68Q25 PDFBibTeX XMLCite \textit{M. Mucha} and \textit{M. Sviridenko}, Math. Oper. Res. 41, No. 1, 247--254 (2016; Zbl 1334.90054) Full Text: DOI arXiv
Sviridenko, Maxim; Vondrák, Jan; Ward, Justin Optimal approximation for submodular and supermodular optimization with bounded curvature. (English) Zbl 1371.90143 Indyk, Piotr (ed.), Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, Portland, San Diego, CA, January 4–6, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-374-7; 978-1-61197-373-0/ebook). 1134-1148 (2015). MSC: 90C59 68T20 68W25 90C27 PDFBibTeX XMLCite \textit{M. Sviridenko} et al., in: Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, Portland, San Diego, CA, January 4--6, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1134--1148 (2015; Zbl 1371.90143) Full Text: DOI arXiv
Im, Sungjin; Sviridenko, Maxim New approximations for broadcast scheduling via variants of \(\alpha\)-point rounding. (English) Zbl 1372.68047 Indyk, Piotr (ed.), Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, Portland, San Diego, CA, January 4–6, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-61197-374-7; 978-1-61197-373-0/ebook). 1050-1069 (2015). MSC: 68M20 68W25 90B35 PDFBibTeX XMLCite \textit{S. Im} and \textit{M. Sviridenko}, in: Proceedings of the 26th annual ACM-SIAM symposium on discrete algorithms, SODA 2015, Portland, San Diego, CA, January 4--6, 2015. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1050--1069 (2015; Zbl 1372.68047) Full Text: DOI
Bienkowski, Marcin; Byrka, Jarosław; Chrobak, Marek; Dobbs, Neil; Nowicki, Tomasz; Sviridenko, Maxim; Świrszcz, Grzegorz; Young, Neal E. Approximation algorithms for the joint replenishment problem with deadlines. (English) Zbl 1333.90015 J. Sched. 18, No. 6, 545-560 (2015). MSC: 90B06 90B35 68M20 90C59 PDFBibTeX XMLCite \textit{M. Bienkowski} et al., J. Sched. 18, No. 6, 545--560 (2015; Zbl 1333.90015) Full Text: DOI arXiv
Makarychev, Konstantin; Schudy, Warren; Sviridenko, Maxim Concentration inequalities for nonlinear matroid intersection. (English) Zbl 1312.05032 Random Struct. Algorithms 46, No. 3, 541-571 (2015). MSC: 05B35 68W25 PDFBibTeX XMLCite \textit{K. Makarychev} et al., Random Struct. Algorithms 46, No. 3, 541--571 (2015; Zbl 1312.05032) Full Text: DOI
Makarychev, Konstantin; Manokaran, Rajsekar; Sviridenko, Maxim Maximum quadratic assignment problem: reduction from maximum label cover and LP-based approximation algorithm. (English) Zbl 1398.68199 ACM Trans. Algorithms 10, No. 4, Article No. 18, 18 p. (2014). MSC: 68Q17 68W25 90B80 PDFBibTeX XMLCite \textit{K. Makarychev} et al., ACM Trans. Algorithms 10, No. 4, Article No. 18, 18 p. (2014; Zbl 1398.68199) Full Text: DOI arXiv
Skutella, Martin; Sviridenko, Maxim; Uetz, Marc Stochastic scheduling on unrelated machines. (English) Zbl 1359.68039 Mayr, Ernst W. (ed.) et al., 31st international symposium on theoretical aspects of computer science, STACS’ 14, Lyon, France, March 5–8, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-65-1). LIPIcs – Leibniz International Proceedings in Informatics 25, 639-650 (2014). MSC: 68M20 68W25 90B36 PDFBibTeX XMLCite \textit{M. Skutella} et al., LIPIcs -- Leibniz Int. Proc. Inform. 25, 639--650 (2014; Zbl 1359.68039) Full Text: DOI
Adamczyk, Marek; Sviridenko, Maxim; Ward, Justin Submodular stochastic probing on matroids. (English) Zbl 1359.90111 Mayr, Ernst W. (ed.) et al., 31st international symposium on theoretical aspects of computer science, STACS’ 14, Lyon, France, March 5–8, 2014. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-65-1). LIPIcs – Leibniz International Proceedings in Informatics 25, 29-40 (2014). MSC: 90C27 68W25 90C15 90C59 PDFBibTeX XMLCite \textit{M. Adamczyk} et al., LIPIcs -- Leibniz Int. Proc. Inform. 25, 29--40 (2014; Zbl 1359.90111) Full Text: DOI
Miyazawa, Flávio K.; Pedrosa, Lehilton L. C.; Schouery, Rafael C. S.; Sviridenko, Maxim; Wakabayashi, Yoshiko Polynomial-time approximation schemes for circle packing problems. (English) Zbl 1425.68437 Schulz, Andreas S. (ed.) et al., Algorithms – ESA 2014. 22nd annual European symposium, Wrocław, Poland, September 8–10, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8737, 713-724 (2014). MSC: 68U05 52C15 68W25 90C27 PDFBibTeX XMLCite \textit{F. K. Miyazawa} et al., Lect. Notes Comput. Sci. 8737, 713--724 (2014; Zbl 1425.68437) Full Text: DOI
Im, Sungjin; Sviridenko, Maxim; van der Zwaan, Ruben Preemptive and non-preemptive generalized min sum set cover. (English) Zbl 1358.68321 Math. Program. 145, No. 1-2 (A), 377-401 (2014). MSC: 68W25 68Q17 90B35 90C27 PDFBibTeX XMLCite \textit{S. Im} et al., Math. Program. 145, No. 1--2 (A), 377--401 (2014; Zbl 1358.68321) Full Text: DOI Link
Pedrosa, Lehilton L. C.; Sviridenko, Maxim Integrated supply chain management via randomized rounding. (English) Zbl 1406.90018 Pardo, Alberto (ed.) et al., LATIN 2014: theoretical informatics. 11th Latin American symposium, Montevideo, Uruguay, March 31 – April 4, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54422-4/pbk). Lecture Notes in Computer Science 8392, 562-573 (2014). MSC: 90B06 68W25 90B05 PDFBibTeX XMLCite \textit{L. L. C. Pedrosa} and \textit{M. Sviridenko}, Lect. Notes Comput. Sci. 8392, 562--573 (2014; Zbl 1406.90018) Full Text: DOI
Bampis, Evripidis; Kononov, Alexander; Letsios, Dimitrios; Lucarelli, Giorgio; Sviridenko, Maxim Energy efficient scheduling and routing via randomized rounding. (English) Zbl 1359.68034 Seth, Anil (ed.) et al., 33nd international conference on foundations of software technology and theoretical computer science, FSTTCS 2013, Guwahati, India, December 12–14, 2013. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-64-4). LIPIcs – Leibniz International Proceedings in Informatics 24, 449-460 (2013). MSC: 68M20 68W20 68W25 90B35 90C35 PDFBibTeX XMLCite \textit{E. Bampis} et al., LIPIcs -- Leibniz Int. Proc. Inform. 24, 449--460 (2013; Zbl 1359.68034) Full Text: DOI arXiv
Mucha, Marcin; Sviridenko, Maxim No-wait flowshop scheduling is as hard as asymmetric traveling salesman problem. (English) Zbl 1336.90041 Fomin, Fedor V. (ed.) et al., Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8–12, 2013, Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-39205-4/pbk). Lecture Notes in Computer Science 7965, 769-779 (2013). MSC: 90B35 68Q17 68W25 90C27 PDFBibTeX XMLCite \textit{M. Mucha} and \textit{M. Sviridenko}, Lect. Notes Comput. Sci. 7965, 769--779 (2013; Zbl 1336.90041) Full Text: DOI arXiv
Bienkowski, Marcin; Byrka, Jaroslaw; Chrobak, Marek; Dobbs, Neil; Nowicki, Tomasz; Sviridenko, Maxim; Świrszcz, Grzegorz; Young, Neal E. Approximation algorithms for the joint replenishment problem with deadlines. (English) Zbl 1336.68289 Fomin, Fedor V. (ed.) et al., Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8–12, 2013, Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-39205-4/pbk). Lecture Notes in Computer Science 7965, 135-147 (2013). MSC: 68W25 68Q17 90B06 PDFBibTeX XMLCite \textit{M. Bienkowski} et al., Lect. Notes Comput. Sci. 7965, 135--147 (2013; Zbl 1336.68289) Full Text: DOI arXiv
Bansal, Nikhil; Han, Xin; Iwama, Kazuo; Sviridenko, Maxim; Zhang, Guochuan A harmonic algorithm for the 3D strip packing problem. (English) Zbl 1271.68250 SIAM J. Comput. 42, No. 2, 579-592 (2013). MSC: 68W40 68W25 68W27 68Q25 PDFBibTeX XMLCite \textit{N. Bansal} et al., SIAM J. Comput. 42, No. 2, 579--592 (2013; Zbl 1271.68250) Full Text: DOI Link
Lee, Jon; Sviridenko, Maxim; Vondrák, Jan Matroid matching: the power of local search. (English) Zbl 1310.68243 SIAM J. Comput. 42, No. 1, 357-379 (2013). MSC: 68W25 05B35 05C65 05C70 90C27 90C59 PDFBibTeX XMLCite \textit{J. Lee} et al., SIAM J. Comput. 42, No. 1, 357--379 (2013; Zbl 1310.68243) Full Text: DOI
Sviridenko, Maxim; Wiese, Andreas Approximating the configuration-LP for minimizing weighted sum of completion times on unrelated machines. (English) Zbl 1377.90034 Goemans, Michel (ed.) et al., Integer programming and combinatorial optimization. 16th international conference, IPCO 2013, Valparaíso, Chile, March 18–20, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36693-2/pbk). Lecture Notes in Computer Science 7801, 387-398 (2013). MSC: 90B35 68W25 90C05 PDFBibTeX XMLCite \textit{M. Sviridenko} and \textit{A. Wiese}, Lect. Notes Comput. Sci. 7801, 387--398 (2013; Zbl 1377.90034) Full Text: DOI
Nonner, Tim; Sviridenko, Maxim An efficient polynomial-time approximation scheme for the joint replenishment problem. (English) Zbl 1377.90007 Goemans, Michel (ed.) et al., Integer programming and combinatorial optimization. 16th international conference, IPCO 2013, Valparaíso, Chile, March 18–20, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-36693-2/pbk). Lecture Notes in Computer Science 7801, 314-323 (2013). MSC: 90B05 68W25 90C39 90C59 PDFBibTeX XMLCite \textit{T. Nonner} and \textit{M. Sviridenko}, Lect. Notes Comput. Sci. 7801, 314--323 (2013; Zbl 1377.90007) Full Text: DOI
Makarychev, Konstantin; Schudy, Warren; Sviridenko, Maxim Concentration inequalities for nonlinear matroid intersection. (English) Zbl 1423.05036 Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 420-436 (2012). MSC: 05B35 68W25 PDFBibTeX XMLCite \textit{K. Makarychev} et al., in: Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17--19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 420--436 (2012; Zbl 1423.05036) Full Text: Link
Saket, Rishi; Sviridenko, Maxim New and improved bounds for the minimum set cover problem. (English) Zbl 1372.68306 Gupta, Anupam (ed.) et al., 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. Berlin: Springer (ISBN 978-3-642-32511-3/pbk). Lecture Notes in Computer Science 7408, 288-300 (2012). MSC: 68W25 68Q17 90C27 PDFBibTeX XMLCite \textit{R. Saket} and \textit{M. Sviridenko}, Lect. Notes Comput. Sci. 7408, 288--300 (2012; Zbl 1372.68306) Full Text: DOI
Im, Sungjin; Sviridenko, Maxim; van der Zwaan, Ruben Preemptive and non-preemptive generalized min sum set cover. (English) Zbl 1245.68250 Dürr, Christoph (ed.) et al., STACS 2012. 29th international symposium on theoretical aspects of computer science, Paris, France, February 29th – March 3rd, 2012. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-939897-35-4). LIPIcs – Leibniz International Proceedings in Informatics 14, 465-476, electronic only (2012). MSC: 68W25 68Q17 90C27 PDFBibTeX XMLCite \textit{S. Im} et al., LIPIcs -- Leibniz Int. Proc. Inform. 14, 465--476 (2012; Zbl 1245.68250) Full Text: DOI
Sviridenko, Maxim A note on the Kenyon-Remila strip-packing algorithm. (English) Zbl 1233.68141 Inf. Process. Lett. 112, No. 1-2, 10-12 (2012). MSC: 68Q17 68W25 68U05 PDFBibTeX XMLCite \textit{M. Sviridenko}, Inf. Process. Lett. 112, No. 1--2, 10--12 (2012; Zbl 1233.68141) Full Text: DOI
Halldórsson, Magnús M.; Kortsarz, Guy; Sviridenko, Maxim Sum edge coloring of multigraphs via configuration LP. (English) Zbl 1295.90010 ACM Trans. Algorithms 7, No. 2, Article No. 22, 21 p. (2011). MSC: 90B35 05C15 05C85 68M20 68W25 90C35 PDFBibTeX XMLCite \textit{M. M. Halldórsson} et al., ACM Trans. Algorithms 7, No. 2, Article No. 22, 21 p. (2011; Zbl 1295.90010) Full Text: DOI
Fleischer, Lisa; Goemans, Michel X.; Mirrokni, Vahab S.; Sviridenko, Maxim Tight approximation algorithms for maximum separable assignment problems. (English) Zbl 1238.68187 Math. Oper. Res. 36, No. 3, 416-431 (2011). MSC: 68W25 90C27 90B80 90C05 PDFBibTeX XMLCite \textit{L. Fleischer} et al., Math. Oper. Res. 36, No. 3, 416--431 (2011; Zbl 1238.68187) Full Text: DOI Link
Makarychev, Konstantin; Sviridenko, Maxim Maximizing polynomials subject to assignment constraints. (English) Zbl 1334.68302 Aceto, Luca (ed.) et al., Automata, languages and programming. 38th international colloquium, ICALP 2011, Zurich, Switzerland, July 4–8, 2011. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-22005-0/pbk). Lecture Notes in Computer Science 6755, 510-520 (2011). MSC: 68W25 90B80 90C27 90C59 PDFBibTeX XMLCite \textit{K. Makarychev} and \textit{M. Sviridenko}, Lect. Notes Comput. Sci. 6755, 510--520 (2011; Zbl 1334.68302) Full Text: DOI
Bansal, Nikhil; Chen, Ning; Cherniavsky, Neva; Rurda, Atri; Schieber, Baruch; Sviridenko, Maxim Dynamic pricing for impatient bidders. (English) Zbl 1300.91031 ACM Trans. Algorithms 6, No. 2, Article No. 35, 21 p. (2010). MSC: 91B26 68Q17 68W27 PDFBibTeX XMLCite \textit{N. Bansal} et al., ACM Trans. Algorithms 6, No. 2, Article No. 35, 21 p. (2010; Zbl 1300.91031) Full Text: DOI
Lee, Jon; Sviridenko, Maxim; Vondrak, Jan Matroid matching: the power of local search. (English) Zbl 1293.05035 Proceedings of the 42nd annual ACM symposium on theory of computing, STOC ’10. Cambridge, MA, USA, June 5–8, 2010. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-817-9). 369-378 (2010). MSC: 05B35 05C65 05C70 68W25 90C27 90C59 PDFBibTeX XMLCite \textit{J. Lee} et al., in: Proceedings of the 42nd annual ACM symposium on theory of computing, STOC '10. Cambridge, MA, USA, June 5--8, 2010. New York, NY: Association for Computing Machinery (ACM). 369--378 (2010; Zbl 1293.05035) Full Text: DOI
Lee, Jon; Sviridenko, Maxim; Vondrák, Jan Submodular maximization over multiple matroids via generalized exchange properties. (English) Zbl 1216.68342 Math. Oper. Res. 35, No. 4, 795-806 (2010). MSC: 68W25 68R05 05B35 90C27 PDFBibTeX XMLCite \textit{J. Lee} et al., Math. Oper. Res. 35, No. 4, 795--806 (2010; Zbl 1216.68342) Full Text: DOI
Makarychev, Konstantin; Manokaran, Rajsekar; Sviridenko, Maxim Maximum quadratic assignment problem: reduction from maximum label cover and LP-based approximation algorithm. (English) Zbl 1288.68273 Abramsky, Samson (ed.) et al., Automata, languages and programming. 37th international colloquium, ICALP 2010, Bordeaux, France, July 6–10, 2010. Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-14164-5/pbk). Lecture Notes in Computer Science 6198, 594-604 (2010). MSC: 68W25 90B80 90C35 PDFBibTeX XMLCite \textit{K. Makarychev} et al., Lect. Notes Comput. Sci. 6198, 594--604 (2010; Zbl 1288.68273) Full Text: DOI arXiv
Nagarajan, Viswanath; Sviridenko, Maxim On the maximum quadratic assignment problem. (English) Zbl 1423.90234 Mathieu, Claire (ed.), Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4–6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 516-524 (2009). MSC: 90C27 68W20 68W25 68W40 90B80 90C59 PDFBibTeX XMLCite \textit{V. Nagarajan} and \textit{M. Sviridenko}, in: Proceedings of the 20th annual ACM-SIAM symposium on discrete algorithms, SODA 2009, New York, NY, USA, January 4--6, 2009. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 516--524 (2009; Zbl 1423.90234) Full Text: Link
Lee, Jon; Mirrokni, Vahab S.; Nagarajan, Viswanath; Sviridenko, Maxim Non-monotone submodular maximization under matroid and knapsack constraints. (English) Zbl 1304.90173 Proceedings of the 41st annual ACM symposium on theory of computing, STOC ’09. Bethesda, MD, USA, May 31 – June 2, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-613-7). 323-332 (2009). MSC: 90C27 68W25 PDFBibTeX XMLCite \textit{J. Lee} et al., in: Proceedings of the 41st annual ACM symposium on theory of computing, STOC '09. Bethesda, MD, USA, May 31 -- June 2, 2009. New York, NY: Association for Computing Machinery (ACM). 323--332 (2009; Zbl 1304.90173) Full Text: DOI arXiv
Hassin, Refael; Levin, Asaf; Sviridenko, Maxim Approximating the minimum quadratic assignment problems. (English) Zbl 1300.90024 ACM Trans. Algorithms 6, No. 1, Article No. 18, 10 p. (2009). MSC: 90C20 68Q17 68W25 90C35 PDFBibTeX XMLCite \textit{R. Hassin} et al., ACM Trans. Algorithms 6, No. 1, Article No. 18, 10 p. (2009; Zbl 1300.90024) Full Text: DOI Link
Nagarajan, Viswanath; Sviridenko, Maxim On the maximum quadratic assignment problem. (English) Zbl 1220.90110 Math. Oper. Res. 34, No. 4, 859-868 (2009). MSC: 90C27 90C59 68W25 68W40 68W20 PDFBibTeX XMLCite \textit{V. Nagarajan} and \textit{M. Sviridenko}, Math. Oper. Res. 34, No. 4, 859--868 (2009; Zbl 1220.90110) Full Text: DOI Link
Nagarajan, Viswanath; Sviridenko, Maxim Tight bounds for permutation flow shop scheduling. (English) Zbl 1231.90209 Math. Oper. Res. 34, No. 2, 417-427 (2009). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{V. Nagarajan} and \textit{M. Sviridenko}, Math. Oper. Res. 34, No. 2, 417--427 (2009; Zbl 1231.90209) Full Text: DOI
Lee, Jon; Mirrokni, Vahab S.; Nagarajan, Viswanath; Sviridenko, Maxim Maximizing nonmonotone submodular functions under matroid or knapsack constraints. (English) Zbl 1207.68445 SIAM J. Discrete Math. 23, No. 4, 2053-2078 (2009). MSC: 68W25 90C27 PDFBibTeX XMLCite \textit{J. Lee} et al., SIAM J. Discrete Math. 23, No. 4, 2053--2078 (2009; Zbl 1207.68445) Full Text: DOI Link
Bansal, Nikhil; Caprara, Alberto; Sviridenko, Maxim A new approximation method for set covering problems, with applications to multidimensional bin packing. (English) Zbl 1201.90071 SIAM J. Comput. 39, No. 4, 1256-1278 (2009). MSC: 90B35 68W25 60K30 90C59 PDFBibTeX XMLCite \textit{N. Bansal} et al., SIAM J. Comput. 39, No. 4, 1256--1278 (2009; Zbl 1201.90071) Full Text: DOI Link
Bansal, Nikhil; Caprara, Alberto; Jansen, Klaus; Prädel, Lars; Sviridenko, Maxim A structural lemma in 2-dimensional packing, and its implications on approximability. (English) Zbl 1272.52018 Dong, Yingfei (ed.) et al., Algorithms and computation. 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16–18, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10630-9/pbk). Lecture Notes in Computer Science 5878, 77-86 (2009). MSC: 52B55 68W25 PDFBibTeX XMLCite \textit{N. Bansal} et al., Lect. Notes Comput. Sci. 5878, 77--86 (2009; Zbl 1272.52018) Full Text: DOI
Lee, Jon; Sviridenko, Maxim; Vondrák, Jan Submodular maximization over multiple matroids via generalized exchange properties. (English) Zbl 1255.90106 Dinur, Irit (ed.) et al., Approximation, randomization, and combinatorial optimization. Algorithms and techniques. 12th international workshop, APPROX 2009, and 13th international workshop, RANDOM 2009, Berkeley, CA, USA, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03684-2/pbk). Lecture Notes in Computer Science 5687, 244-257 (2009). MSC: 90C27 05B35 68W25 PDFBibTeX XMLCite \textit{J. Lee} et al., Lect. Notes Comput. Sci. 5687, 244--257 (2009; Zbl 1255.90106) Full Text: DOI
Even, Guy; Levi, Retsef; Rawitz, Dror; Schieber, Baruch; Shahar, Shimon (Moni); Sviridenko, Maxim Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs. (English) Zbl 1445.68347 ACM Trans. Algorithms 4, No. 3, Article No. 34, 17 p. (2008). MSC: 68W25 68U05 PDFBibTeX XMLCite \textit{G. Even} et al., ACM Trans. Algorithms 4, No. 3, Article No. 34, 17 p. (2008; Zbl 1445.68347) Full Text: DOI
Levi, Retsef; Roundy, Robin; Shmoys, David; Sviridenko, Maxim A constant approximation algorithm for the one-warehouse multiretailer problem. (English) Zbl 1232.90071 Manage. Sci. 54, No. 4, 763-776 (2008). MSC: 90B05 90C05 PDFBibTeX XMLCite \textit{R. Levi} et al., Manage. Sci. 54, No. 4, 763--776 (2008; Zbl 1232.90071) Full Text: DOI
Levi, Retsef; Lodi, Andrea; Sviridenko, Maxim Approximation algorithms for the capacitated multi-item lot-sizing problem via flow-cover inequalities. (English) Zbl 1231.90046 Math. Oper. Res. 33, No. 2, 461-474 (2008). MSC: 90B05 68W25 90C59 PDFBibTeX XMLCite \textit{R. Levi} et al., Math. Oper. Res. 33, No. 2, 461--474 (2008; Zbl 1231.90046) Full Text: DOI
Buchbinder, N.; Kimbrel, T.; Levi, R.; Makarychev, K.; Sviridenko, M. Online make-to-order joint replenishment model: Primal dual competitive algorithms. (English) Zbl 1192.90005 Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, January 20–22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-47-4). 952-961 (2008). MSC: 90B05 90-04 68W25 PDFBibTeX XMLCite \textit{N. Buchbinder} et al., in: Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2008, San Francisco, CA, January 20--22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 952--961 (2008; Zbl 1192.90005)
Bansal, Nikhil; Coppersmith, Don; Sviridenko, Maxim Improved approximation algorithms for broadcast scheduling. (English) Zbl 1187.68704 SIAM J. Comput. 38, No. 3, 1157-1174 (2008). MSC: 68W25 68M20 68Q25 68W40 90B35 90C59 PDFBibTeX XMLCite \textit{N. Bansal} et al., SIAM J. Comput. 38, No. 3, 1157--1174 (2008; Zbl 1187.68704) Full Text: DOI Link
Kimbrel, Tracy; Sviridenko, Maxim High-multiplicity cyclic job shop scheduling. (English) Zbl 1210.90089 Oper. Res. Lett. 36, No. 5, 574-578 (2008). MSC: 90B35 PDFBibTeX XMLCite \textit{T. Kimbrel} and \textit{M. Sviridenko}, Oper. Res. Lett. 36, No. 5, 574--578 (2008; Zbl 1210.90089) Full Text: DOI
Halldórsson, Magnús M.; Kortsarz, Guy; Sviridenko, Maxim Min sum edge coloring in multigraphs via configuration LP. (English) Zbl 1143.90334 Lodi, Andrea (ed.) et al., Integer programming and combinatorial optimization. 13th international conference, IPCO 2008 Bertinoro, Italy, May 26–28, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-68886-0/pbk). Lecture Notes in Computer Science 5035, 359-373 (2008). MSC: 90B35 68M20 68W25 90C35 PDFBibTeX XMLCite \textit{M. M. Halldórsson} et al., Lect. Notes Comput. Sci. 5035, 359--373 (2008; Zbl 1143.90334) Full Text: DOI
Bansal, Nikhil; Han, Xin; Iwama, Kazuo; Sviridenko, Maxim; Zhang, Guochuan Harmonic algorithm for \(3\)-dimensional strip packing problem. (English) Zbl 1302.90165 Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2007, New Orleans, LA, USA, January 7–9, 2007. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-89871-624-5). 1197-1206 (2007). MSC: 90C27 68W25 PDFBibTeX XMLCite \textit{N. Bansal} et al., in: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2007, New Orleans, LA, USA, January 7--9, 2007. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 1197--1206 (2007; Zbl 1302.90165)
Grigoriev, Alexander; van Loon, Joyce; Sviridenko, Maxim; Uetz, Marc; Vredeveld, Tjark Bundle pricing with comparable items. (English) Zbl 1151.91445 Arge, Lars (ed.) et al., Algorithms – ESA 2007. 15th annual European symposium, Eilat, Israel, October 8–10, 2007, Proceedings. Berlin: Springer (ISBN 978-3-540-75519-7/pbk). Lecture Notes in Computer Science 4698, 475-486 (2007). MSC: 91B24 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. Grigoriev} et al., Lect. Notes Comput. Sci. 4698, 475--486 (2007; Zbl 1151.91445) Full Text: DOI
Levi, Retsef; Lodi, Andrea; Sviridenko, Maxim Approximation algorithms for the multi-item capacitated lot-sizing problem via flow-cover inequalities. (English) Zbl 1136.90408 Fischetti, Matteo (ed.) et al., Integer programming and combinatorial optimization. 12th international IPCO conference, Ithaca, NY, USA, June 25–27, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-72791-0/pbk). Lecture Notes in Computer Science 4513, 454-468 (2007). MSC: 90C10 68W20 68W25 90B35 90C57 90C59 PDFBibTeX XMLCite \textit{R. Levi} et al., Lect. Notes Comput. Sci. 4513, 454--468 (2007; Zbl 1136.90408) Full Text: DOI
Grigoriev, Alexander; Sviridenko, Maxim; Uetz, Marc Machine scheduling with resource dependent processing times. (English) Zbl 1192.90073 Math. Program. 110, No. 1 (B), 209-228 (2007). MSC: 90B35 68W25 68M20 PDFBibTeX XMLCite \textit{A. Grigoriev} et al., Math. Program. 110, No. 1 (B), 209--228 (2007; Zbl 1192.90073) Full Text: DOI Link
Bansal, Nikhil; Sviridenko, Maxim The Santa Claus problem. (English) Zbl 1301.90057 Kleinberg, Jon M. (ed.), Proceedings of the 38th annual ACM symposium on theory of computing, STOC 2006. Seattle, WA, USA, May 21–23, 2006. New York, NY: ACM Press (ISBN 1-59593-134-1). 31-40 (2006). MSC: 90C05 90B35 90C27 68W25 PDFBibTeX XMLCite \textit{N. Bansal} and \textit{M. Sviridenko}, in: Proceedings of the 38th annual ACM symposium on theory of computing, STOC 2006. Seattle, WA, USA, May 21--23, 2006. New York, NY: ACM Press. 31--40 (2006; Zbl 1301.90057) Full Text: DOI
Fleischer, Lisa; Goemans, Michel X.; Mirrokni, Vahab S.; Sviridenko, Maxim Tight approximation algorithms for maximum general assignment problems. (English) Zbl 1192.90105 Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22–24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-605-5). 611-620 (2006). MSC: 90B80 68W25 PDFBibTeX XMLCite \textit{L. Fleischer} et al., in: Proceedings of the seventeenth annual ACM-SIAM symposium on discrete algorithms, SODA 2006, Miami, FL, January 22--24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 611--620 (2006; Zbl 1192.90105) Full Text: DOI
Bansal, Nikhil; Coppersmith, Don; Sviridenko, Maxim Improved approximation algorithms for broadcast scheduling. (English) Zbl 1192.90061 Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, Miami, FL, January 22–24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-605-5). 344-353 (2006). MSC: 90B35 68W25 PDFBibTeX XMLCite \textit{N. Bansal} et al., in: Proceedings of the seventeenth annual ACM-SIAM symposium on discrete algorithms, SODA 2006, Miami, FL, January 22--24, 2006. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 344--353 (2006; Zbl 1192.90061) Full Text: DOI Link
Bansal, Nikhil; Kimbrel, Tracy; Sviridenko, Maxim Job shop scheduling with unit processing times. (English) Zbl 1278.90140 Math. Oper. Res. 31, No. 2, 381-389 (2006). MSC: 90B35 PDFBibTeX XMLCite \textit{N. Bansal} et al., Math. Oper. Res. 31, No. 2, 381--389 (2006; Zbl 1278.90140) Full Text: DOI
Bansal, Nikhil; Correa, José R.; Kenyon, Claire; Sviridenko, Maxim Bin packing in multiple dimensions: inapproximability results and approximation schemes. (English) Zbl 1278.90324 Math. Oper. Res. 31, No. 1, 31-49 (2006). MSC: 90C27 PDFBibTeX XMLCite \textit{N. Bansal} et al., Math. Oper. Res. 31, No. 1, 31--49 (2006; Zbl 1278.90324) Full Text: DOI
Levi, Retsef; Sviridenko, Maxim Improved approximation algorithm for the one-warehouse multi-retailer problem. (English) Zbl 1155.90311 Díaz, Josep (ed.) et al., Approximation, randomization and combinatorial optimization. Algorithms and techniques. 9th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2006, and 10th international workshop on randomization and computation, RANDOM 2006, Barcelona, Spain, August 28–30, 2006. Proceedings. Berlin: Springer (ISBN 3-540-38044-2/pbk). Lecture Notes in Computer Science 4110, 188-199 (2006). MSC: 90B05 68W25 PDFBibTeX XMLCite \textit{R. Levi} and \textit{M. Sviridenko}, Lect. Notes Comput. Sci. 4110, 188--199 (2006; Zbl 1155.90311) Full Text: DOI
Li, Wenhua; Queyranne, Maurice; Sviridenko, Maxim; Yuan, Jinjiang Approximation algorithms for shop scheduling problems with minsum objective: A correction. (English) Zbl 1154.90469 J. Sched. 9, No. 6, 569-570 (2006). MSC: 90B35 PDFBibTeX XMLCite \textit{W. Li} et al., J. Sched. 9, No. 6, 569--570 (2006; Zbl 1154.90469) Full Text: DOI
Bansal, Nikhil; Kimbrel, Tracy; Sviridenko, Maxim Job shop scheduling with unit processing times. (English) Zbl 1297.68039 Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23–25, 2005. New York, NY: ACM Press (ISBN 0-89871-585-7). 207-214 (2005). MSC: 68M20 68W25 68W20 PDFBibTeX XMLCite \textit{N. Bansal} et al., in: Proceedings of the sixteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2005, Vancouver, BC, Canada, January 23--25, 2005. New York, NY: ACM Press. 207--214 (2005; Zbl 1297.68039)
Kaplan, Haim; Lewenstein, Moshe; Shafrir, Nira; Sviridenko, Maxim Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs. (English) Zbl 1323.68572 J. ACM 52, No. 4, 602-626 (2005). MSC: 68W25 90C27 90C35 PDFBibTeX XMLCite \textit{H. Kaplan} et al., J. ACM 52, No. 4, 602--626 (2005; Zbl 1323.68572) Full Text: DOI
Bansal, Nikhil; Mahdian, Mohammad; Sviridenko, Maxim Minimizing makespan in no-wait job shops. (English) Zbl 1278.90141 Math. Oper. Res. 30, No. 4, 817-831 (2005). MSC: 90B35 PDFBibTeX XMLCite \textit{N. Bansal} et al., Math. Oper. Res. 30, No. 4, 817--831 (2005; Zbl 1278.90141) Full Text: DOI Link
Bläser, Markus; Ram, L. Shankar; Sviridenko, Maxim Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems. (English) Zbl 1161.68874 Dehne, Frank (ed.) et al., Algorithms and data structures. 9th international workshop, WADS 2005, Waterloo, Canada, August 15–17, 2005. Proceedings. Berlin: Springer (ISBN 3-540-28101-0/pbk). Lecture Notes in Computer Science 3608, 350-359 (2005). MSC: 68W25 90C35 90C59 PDFBibTeX XMLCite \textit{M. Bläser} et al., Lect. Notes Comput. Sci. 3608, 350--359 (2005; Zbl 1161.68874) Full Text: DOI
Gamarnik, David; Lewenstein, Moshe; Sviridenko, Maxim An improved upper bound for the TSP in cubic 3-edge-connected graphs. (English) Zbl 1195.90091 Oper. Res. Lett. 33, No. 5, 467-474 (2005). MSC: 90C35 05C85 PDFBibTeX XMLCite \textit{D. Gamarnik} et al., Oper. Res. Lett. 33, No. 5, 467--474 (2005; Zbl 1195.90091) Full Text: DOI
Bansal, Nikhil; Sviridenko, Maxim New approximability and inapproximability results for 2-dimensional bin packing. (English) Zbl 1317.68269 Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11–13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-558-X). 196-203 (2004). MSC: 68W25 68Q25 68R05 90C27 90C59 PDFBibTeX XMLCite \textit{N. Bansal} and \textit{M. Sviridenko}, in: Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11--13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM). 196--203 (2004; Zbl 1317.68269)
Ageev, A. A.; Sviridenko, M. I. Pipage rounding: a new method of constructing algorithms with proven performance guarantee. (English) Zbl 1084.90029 J. Comb. Optim. 8, No. 3, 307-328 (2004). MSC: 90C09 90C27 68W25 PDFBibTeX XMLCite \textit{A. A. Ageev} and \textit{M. I. Sviridenko}, J. Comb. Optim. 8, No. 3, 307--328 (2004; Zbl 1084.90029) Full Text: DOI
Arkin, Esther M.; Hassin, Refael; Rubinstein, Shlomi; Sviridenko, Maxim Approximations for maximum transportation with permutable supply vector and other capacitated star packing problems. (English) Zbl 1064.68092 Algorithmica 39, No. 2, 175-187 (2004). MSC: 68W25 PDFBibTeX XMLCite \textit{E. M. Arkin} et al., Algorithmica 39, No. 2, 175--187 (2004; Zbl 1064.68092) Full Text: DOI
Lewenstein, Moshe; Sviridenko, Maxim Approximating asymmetric maximum TSP. (English) Zbl 1176.90608 Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, Baltimore, MD, USA, January 12–14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics (ISBN 0-89871-538-5/pbk). 646-654 (2003). MSC: 90C35 68W25 PDFBibTeX XMLCite \textit{M. Lewenstein} and \textit{M. Sviridenko}, in: Proceedings of the fourteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2003, Baltimore, MD, USA, January 12--14, 2003. New York, NY: Association for Computing Machinery; Philadelphia, PA: Society for Industrial and Applied Mathematics. 646--654 (2003; Zbl 1176.90608)
Lewenstein, Moshe; Sviridenko, Maxim A 5/8 approximation algorithm for the maximum asymmetric TSP. (English) Zbl 1091.68123 SIAM J. Discrete Math. 17, No. 2, 237-248 (2003). MSC: 68W25 68W40 68R10 90C35 PDFBibTeX XMLCite \textit{M. Lewenstein} and \textit{M. Sviridenko}, SIAM J. Discrete Math. 17, No. 2, 237--248 (2003; Zbl 1091.68123) Full Text: DOI
Sviridenko, M. Makespan minimization in no-wait flow shops: A polynomial time approximation scheme. (English) Zbl 1045.90034 SIAM J. Discrete Math. 16, No. 2, 313-322 (2003). MSC: 90B35 68W25 90C35 PDFBibTeX XMLCite \textit{M. Sviridenko}, SIAM J. Discrete Math. 16, No. 2, 313--322 (2003; Zbl 1045.90034) Full Text: DOI
Jansen, Klaus; Solis-Oba, Roberto; Sviridenko, Maxim Makespan minimization in job shops: A linear time approximation scheme. (English) Zbl 1051.68153 SIAM J. Discrete Math. 16, No. 2, 288-300 (2003). MSC: 68W25 68W40 90B35 PDFBibTeX XMLCite \textit{K. Jansen} et al., SIAM J. Discrete Math. 16, No. 2, 288--300 (2003; Zbl 1051.68153) Full Text: DOI
Arkin, Esther M.; Hassin, Refael; Rubinstein, Shlomi; Sviridenko, Maxim Approximations for maximum transportation problem with permutable supply vector and other capacitated star packing problems. (English) Zbl 1078.90511 Penttonen, Martti (ed.) et al., Algorithm theory - SWAT 2002. 8th Scandinavian workshop, Turku, Finland, July 3–5, 2002. Proceedings. Berlin: Springer (ISBN 3-540-43866-1). Lect. Notes Comput. Sci. 2368, 280-287 (2002). MSC: 90B06 90C08 90C27 05C85 68W25 PDFBibTeX XMLCite \textit{E. M. Arkin} et al., Lect. Notes Comput. Sci. 2368, 280--287 (2002; Zbl 1078.90511) Full Text: DOI
Queyranne, Maurice; Sviridenko, Maxim Approximation algorithms for shop scheduling problems with minsum objective. (English) Zbl 1009.90046 J. Sched. 5, No. 4, 287-305 (2002). MSC: 90B35 90C59 90C05 PDFBibTeX XMLCite \textit{M. Queyranne} and \textit{M. Sviridenko}, J. Sched. 5, No. 4, 287--305 (2002; Zbl 1009.90046) Full Text: DOI
Queyranne, Maurice; Sviridenko, Maxim A \((2+\varepsilon)\)-approximation algorithm for generalized preemptive open shop problem with minsum objective. (English) Zbl 1010.90506 Aardal, Karen (ed.) et al., Integer programming and combinatorial optimization. 8th international IPCO conference, Utrecht, Netherlands, June 13-15, 2001. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2081, 361-369 (2001). MSC: 90B35 68W25 68Q25 PDFBibTeX XMLCite \textit{M. Queyranne} and \textit{M. Sviridenko}, Lect. Notes Comput. Sci. 2081, 361--369 (2001; Zbl 1010.90506) Full Text: Link
Sviridenko, M. I. Best possible approximation algorithm for MAX SAT with cardinality constraint. (English) Zbl 1136.90493 Algorithmica 30, No. 3, 398-405 (2001). MSC: 90C35 68W25 68Q17 PDFBibTeX XMLCite \textit{M. I. Sviridenko}, Algorithmica 30, No. 3, 398--405 (2001; Zbl 1136.90493) Full Text: DOI
Ageev, Alexander; Hassin, Refael; Sviridenko, Maxim A 0. 5-approximation algorithm for MAX DICUT with given sizes of parts. (English) Zbl 0968.68198 SIAM J. Discrete Math. 14, No. 2, 246-255 (2001). MSC: 68W25 90C27 90C35 05C85 PDFBibTeX XMLCite \textit{A. Ageev} et al., SIAM J. Discrete Math. 14, No. 2, 246--255 (2001; Zbl 0968.68198) Full Text: DOI
Ageev, Alexander A.; Sviridenko, Maxim I. An approximation algorithm for Hypergraph Max \(k\)-Cut with given sizes of parts. (English) Zbl 0974.68248 Paterson, Mike (ed.), Algorithms - ESA 2000. 8th annual European symposium, Saarbrücken, Germany, September 5-8, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1879, 32-41 (2000). MSC: 68W25 68R10 PDFBibTeX XMLCite \textit{A. A. Ageev} and \textit{M. I. Sviridenko}, Lect. Notes Comput. Sci. 1879, 32--41 (2000; Zbl 0974.68248)
Ageev, Alexander; Hassin, Refael; Sviridenko, Maxim An approximation algorithm for MAX DICUT with given sizes of parts. (English) Zbl 0976.05060 Jansen, Klaus (ed.) et al., Approximation algorithms for combinatorial optimization. 3rd international workshop, APPROX 2000, Saarbrücken, Germany, September 5-8, 2000. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1913, 34-41 (2000). MSC: 05C85 68W25 PDFBibTeX XMLCite \textit{A. Ageev} et al., Lect. Notes Comput. Sci. 1913, 34--41 (2000; Zbl 0976.05060)
Jansen, Klaus; Solis-Oba, Roberto; Sviridenko, Maxim Makespan minimization in job shops: a polynomial time approximation scheme. (English) Zbl 1345.90044 Vitter, Jeffrey Scott (ed.) et al., Proceedings of the 31st annual ACM symposium on theory of computing, STOC 1999. Atlanta, GA, USA, May 1–4, 1999. New York, NY: ACM, Association for Computing Machinery (ISBN 1-58113-067-8). 394-399 (1999). MSC: 90B35 68W25 90C59 PDFBibTeX XMLCite \textit{K. Jansen} et al., in: Proceedings of the 31st annual ACM symposium on theory of computing, STOC 1999. Atlanta, GA, USA, May 1--4, 1999. New York, NY: ACM, Association for Computing Machinery. 394--399 (1999; Zbl 1345.90044) Full Text: DOI
Ageev, Alexander A.; Sviridenko, Maxim I. Approximation algorithms for maximum coverage and max cut with given sizes of parts. (English) Zbl 0948.90122 Cornuéjols, Gérard (ed.) et al., Integer programming and combinatorial optimization. 7th international IPCO conference, Graz, Austria, June 9-11, 1999. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1610, 17-30 (1999). MSC: 90C27 90C59 PDFBibTeX XMLCite \textit{A. A. Ageev} and \textit{M. I. Sviridenko}, Lect. Notes Comput. Sci. 1610, 17--30 (1999; Zbl 0948.90122)