A note on the Kenyon-Remila strip-packing algorithmSVIRIDENKO, Maxim.Information processing letters. 2012, Vol 112, Num 1-2, pp 10-12, issn 0020-0190, 3 p.Article

High-multiplicity cyclic job shop schedulingKIMBREL, Tracy; SVIRIDENKO, Maxim.Operations research letters. 2008, Vol 36, Num 5, pp 574-578, issn 0167-6377, 5 p.Article

Improved approximation algorithm for the one-warehouse multi-retailer problemLEVI, Retsef; SVIRIDENKO, Maxim.Lecture notes in computer science. 2006, pp 188-199, issn 0302-9743, isbn 3-540-38044-2, 1Vol, 12 p.Conference Paper

A (2 + ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objectiveQUEYRANNE, Maurice; SVIRIDENKO, Maxim.Journal of algorithms (Print). 2002, Vol 45, Num 2, pp 202-212, issn 0196-6774, 11 p.Article

Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problemsBLÄSER, Markus; SHANKAR RAM, L; SVIRIDENKO, Maxim et al.Operations research letters. 2009, Vol 37, Num 3, pp 176-180, issn 0167-6377, 5 p.Article

Approximating the maximum quadratic assignment problemARKIN, Esther M; HASSIN, Refael; SVIRIDENKO, Maxim et al.Information processing letters. 2001, Vol 77, Num 1, pp 13-16, issn 0020-0190Article

Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphsKAPLAN, Haim; LEWENSTEIN, Moshe; SHAFRIR, Nira et al.Journal of the Association for Computing Machinery. 2005, Vol 52, Num 4, pp 602-626, issn 0004-5411, 25 p.Article

A Constant Approximation Algorithm for the One-Warehouse Multiretailer ProblemLEVI, Retsef; ROUNDY, Robin; SHMOYS, David et al.Management science. 2008, Vol 54, Num 4, pp 763-776, issn 0025-1909, 14 p.Article

An improved approximation algorithm for the metric uncapacitated facility location problemSVIRIDENKO, Maxim.Lecture notes in computer science. 2002, pp 240-257, issn 0302-9743, isbn 3-540-43676-6, 18 p.Conference Paper

MAXIMIZING NONMONOTONE SUBMODULAR FUNCTIONS UNDER MATROID OR KNAPSACK CONSTRAINTSLEE, Jon; MIRROKNI, Vahab S; NAGARAJAN, Viswanath et al.SIAM journal on discrete mathematics (Print). 2010, Vol 23, Num 4, pp 2053-2078, issn 0895-4801, 26 p.Article

Dynamic application placement under service and memory constraintsKIMBREL, Tracy; STEINDER, Malgorzata; SVIRIDENKO, Maxim et al.Lecture notes in computer science. 2005, pp 391-402, issn 0302-9743, isbn 3-540-25920-1, 12 p.Conference Paper

Buffer overflow management in QoS switchesKESSELMAN, Alexander; LOTKER, Zvi; MANSOUR, Yishay et al.SIAM journal on computing (Print). 2004, Vol 33, Num 3, pp 563-583, issn 0097-5397, 21 p.Article

Further improvements in competitive guarantees for QoS bufferingBANSAL, Nikhil; FLEISCHER, Lisa K; KIMBREL, Tracy et al.Lecture notes in computer science. 2004, pp 196-207, issn 0302-9743, isbn 3-540-22849-7, 12 p.Conference Paper