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 × Greece
1 × United Kingdom
3 × USA
Collaborated with:
S.Li L.Polacek M.Mastrolilli
Talks about:
schedul (3) approxim (2) machin (2) constrain (1) restrict (1) polynomi (1) search (1) pseudo (1) preced (1) median (1)

Person: Ola Svensson

DBLP DBLP: Svensson:Ola

Contributed to:

STOC 20132013
ICALP (1) 20122012
STOC 20112011
STOC 20102010
ICALP (1) 20092009

Wrote 5 papers:

STOC-2013-LiS #approximate #pseudo
Approximating k-median via pseudo-approximation (SL, OS), pp. 901–910.
ICALP-v1-2012-PolacekS #strict
Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation (LP, OS), pp. 726–737.
Santa Claus schedules jobs on unrelated machines (OS), pp. 617–626.
STOC-2010-Svensson #precedence #scheduling
Conditional hardness of precedence constrained scheduling on identical machines (OS), pp. 745–754.
ICALP-v1-2009-MastrolilliS #bound #scheduling
Improved Bounds for Flow Shop Scheduling (MM, OS), pp. 677–688.

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.