Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Svensson, Ola"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Centrality of trees for capacitated
k
-center
Hyung-Chan An
,
Aditya Bhaskara
,
Chandra Chekuri
,
Shalmoli Gupta
,
Vivek Madan
,
Ola Svensson
Lecture Notes in Computer Science
8494
, 2014, pp. 52-63
Strong LP formulations for scheduling splittable jobs on unrelated machines
José R. Correa
,
Alberto Marchetti-Spaccamela
,
Jannik Matuschke
,
Leen Stougie
,
Ola Svensson
,
Víctor Verdugo
,
José Verschae
Lecture Notes in Computer Science
8494
, 2014, pp. 249-260
On the configuration LP for maximum budgeted allocation
Christos Kalaitzis
,
Aleksander Ma̧dry
,
Alantha Newman
,
Lukás̑ Polác̑ek
,
Ola Svensson
Lecture Notes in Computer Science
8494
, 2014, pp. 333-344
Approximating
k
-median via pseudo-approximation
Shi Li
,
Ola Svensson
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 901-910
Single machine scheduling with scenarios
Monaldo Mastrolilli
,
Nikolaus Mutsanas
,
Ola Svensson
Theoretical Computer Science
477
, 2013, pp. 57-66
Overview of new approaches for approximating TSP
Ola Svensson
Lecture Notes in Computer Science
8165
, 2013, pp. 5-11
Quasi-polynomial local search for restricted max-min fair allocation
Lukas Polacek
,
Ola Svensson
Lecture Notes in Computer Science
7391
, 2012, pp. 726-737
Santa Claus schedules jobs on unrelated machines
Ola Svensson
SIAM Journal on Computing
41
(5), 2012, pp. 1318-1341
Inapproximability results for maximum edge biclique, minimum linear arrangement, and sparsest cut
Christoph Ambühl
,
Monaldo Mastrolilli
,
Ola Svensson
SIAM Journal on Computing
40
(2), 2011, pp. 567-596
Hardness of approximating flow and job shop scheduling problems
Monaldo Mastrolilli
,
Ola Svensson
Journal of the ACM
58
(5), 2011, pp. 20: 1-32
Hardness of precedence constrained scheduling on identical machines
Ola Svensson
SIAM Journal on Computing
40
(5), 2011, pp. 1258-1274
Santa Claus schedules jobs on unrelated machines
Ola Svensson
Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC'2011 (San Jose, CA, USA, June 6-8, 2011)
, 2011, pp. 617-626
Conditional hardness of precedence constrained scheduling on identical machines
Ola Svensson
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC'2010 (Cambridge, Massachusetts, June 5-8, 2010)
, 2010, pp. 745-754
Improved bounds for flow shop scheduling
Monaldo Mastrolilli
,
Ola Svensson
Lecture Notes in Computer Science
5555
, 2009, pp. 677-688
Scheduling with precedence constraints of low fractional dimension
Christoph Ambühl
,
Monaldo Mastrolilli
,
Nikolaus Mutsanas
,
Ola Svensson
Lecture Notes in Computer Science
4513
, 2007, pp. 130-144