BibSLEIGH corpus
BibSLEIGH tags
BibSLEIGH bundles
BibSLEIGH people
Open Knowledge
XHTML 1.0 W3C Rec
CSS 2.1 W3C CanRec
email twitter
Travelled to:
1 × Finland
1 × France
1 × Greece
1 × Latvia
1 × Switzerland
4 × USA
Collaborated with:
K.Makarychev N.Bansal J.Lee B.Schieber M.Mucha J.Ward T.Kimbrel R.Manokaran J.Vondrák K.Jansen R.Solis-Oba V.S.Mirrokni V.Nagarajan T.S.Jayram R.Krauthgamer L.Fleischer M.Mahdian A.Kesselman Z.Lotker Y.Mansour B.Patt-Shamir M.Bienkowski J.Byrka M.Chrobak N.B.Dobbs T.Nowicki G.Swirszcz N.E.Young
Talks about:
problem (5) approxim (3) maximum (3) constraint (2) algorithm (2) polynomi (2) matroid (2) server (2) search (2) buffer (2)

Person: Maxim Sviridenko

DBLP DBLP: Sviridenko:Maxim

Contributed to:

ICALP (1) 20132013
ICALP (1) 20112011
ICALP (1) 20102010
STOC 20102010
STOC 20092009
STOC 20062006
ICALP 20042004
STOC 20012001
STOC 19991999

Wrote 12 papers:

ICALP-v1-2013-BienkowskiBCDNSSY #algorithm #approximate #problem
Approximation Algorithms for the Joint Replenishment Problem with Deadlines (MB, JB, MC, NBD, TN, MS, GS, NEY), pp. 135–147.
ICALP-v1-2013-MuchaS #problem #scheduling #symmetry
No-Wait Flowshop Scheduling Is as Hard as Asymmetric Traveling Salesman Problem (MM, MS), pp. 769–779.
ICALP-v1-2013-SviridenkoW #problem #scalability #set
Large Neighborhood Local Search for the Maximum Set Packing Problem (MS, JW), pp. 792–803.
ICALP-v1-2011-MakarychevS #constraints
Maximizing Polynomials Subject to Assignment Constraints (KM, MS), pp. 510–520.
ICALP-v1-2010-MakarychevMS #algorithm #approximate #polynomial #problem #reduction
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-Based Approximation Algorithm (KM, RM, MS), pp. 594–604.
STOC-2010-LeeSV #power of
Matroid matching: the power of local search (JL, MS, JV), pp. 369–378.
STOC-2009-LeeMNS #constraints
Non-monotone submodular maximization under matroid and knapsack constraints (JL, VSM, VN, MS), pp. 323–332.
STOC-2006-BansalS #problem
The Santa Claus problem (NB, MS), pp. 31–40.
Further Improvements in Competitive Guarantees for QoS Buffering (NB, LF, TK, MM, BS, MS), pp. 196–207.
STOC-2001-JayramKKSS #online
Online server allocation in a server farm via benefit task systems (TSJ, TK, RK, BS, MS), pp. 540–549.
Buffer overflow management in QoS switches (AK, ZL, YM, BPS, BS, MS), pp. 520–529.
STOC-1999-JansenSS #approximate #polynomial
Makespan Minimization in Job Shops: A Polynomial Time Approximation Scheme (KJ, RSO, MS), pp. 394–399.

Bibliography of Software Language Engineering in Generated Hypertext (BibSLEIGH) is created and maintained by Dr. Vadim Zaytsev.
Hosted as a part of SLEBOK on GitHub.