Publications :: Search

Show author

On this page you see the details of the selected author.

Author information
First name:	Ola
Last name:	Svensson
DBLP:	11/6945
Rating:	(not rated yet)
Bookmark:

Below you find the publications which have been written by this author.

Show item 1 to 25 of 32  

Select a publication
Show	Title	Venue	Rating	Date
	Journal article Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson. Single machine scheduling with scenarios.	Theor. Comput. Sci. 2013, Volume 477	(0)	2013
	Journal article Hyung-Chan An, Aditya Bhaskara, Ola Svensson. Centrality of Trees for Capacitated k-Center	CoRR 2013, Volume 0	(0)	2013
	Journal article Mahdi Cheraghchi, Johan Håstad, Marcus Isaksson, Ola Svensson. Approximating Linear Threshold Predicates.	TOCT 2012, Volume 4	(0)	2012
	Conference paper Lukas Polacek, Ola Svensson. Quasi-polynomial Local Search for Restricted Max-Min Fair Allocation.	Automata, Languages, and Programming - 39th International Colloquium, ICALP 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part I 2012	(0)	2012
	Conference paper Ola Svensson. Hardness of Vertex Deletion and Project Scheduling.	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 2012	(0)	2012
	Conference paper Florian Diedrich, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson. Tight approximation algorithms for scheduling with fixed jobs and nonavailability.	ACM Transactions on Algorithms 2012, Volume 8	(0)	2012
	Conference paper Lukas Polacek, Ola Svensson. Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation	CoRR 2012, Volume 0	(0)	2012
	Conference paper Ola Svensson. Hardness of Vertex Deletion and Project Scheduling	CoRR 2012, Volume 0	(0)	2012
	Journal article Shi Li, Ola Svensson. Approximating $k$-Median via Pseudo-Approximation	CoRR 2012, Volume 0	(0)	2012
	Conference paper Ola Svensson. Santa Claus Schedules Jobs on Unrelated Machines.	SIAM J. Comput. 2012, Volume 41	(0)	2012
	Journal article Tobias Mömke, Ola Svensson. Approximating Graphic TSP by Matchings	CoRR 2011, Volume 0	(0)	2011
	Conference paper Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson. Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut.	SIAM J. Comput. 2011, Volume 40	(0)	2011
	Conference paper Ola Svensson. Santa Claus schedules jobs on unrelated machines.	Proceedings of the 43rd ACM Symposium on Theory of Computing, STOC 2011, San Jose, CA, USA, 6-8 June 2011 2011	(0)	2011
	Conference paper Ola Svensson. Hardness of Precedence Constrained Scheduling on Identical Machines.	SIAM J. Comput. 2011, Volume 40	(0)	2011
	Conference paper Monaldo Mastrolilli, Ola Svensson. Hardness of Approximating Flow and Job Shop Scheduling Problems.	J. ACM 2010, Volume 58	(0)	2011
	Conference paper Tobias Mömke, Ola Svensson. Approximating Graphic TSP by Matchings.	IEEE 52nd Annual Symposium on Foundations of Computer Science, FOCS 2011, Palm Springs, CA, USA, October 22-25, 2011 2011	(0)	2011
	Conference paper Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson. On the Approximability of Single-Machine Scheduling with Precedence Constraints.	Math. Oper. Res. 2011, Volume 36	(0)	2011
	Conference paper Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson. Faster Approximation Algorithms for Scheduling with Fixed Jobs.	Seventeenth Computing: The Australasian Theory Symposium, CATS 2011, Perth, Australia, January 2011 2011	(0)	2011
	Conference paper Ola Svensson. Conditional hardness of precedence constrained scheduling on identical machines.	Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, 5-8 June 2010 2010	(0)	2010
	Conference paper Mahdi Cheraghchi, Johan Håstad, Ola Svensson. Approximating Linear Threshold Predicates.	Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 13th International Workshop, APPROX 2010, and 14th International Workshop, RANDOM 2010, Barcelona, Spain, September 1-3, 2010. Proceedings 2010	(0)	2010
	Conference paper Monaldo Mastrolilli, Maurice Queyranne, Andreas S. Schulz, Ola Svensson, Nelson A. Uhan. Minimizing the sum of weighted completion times in a concurrent open shop.	Oper. Res. Lett. 2010, Volume 38	(0)	2010
	Journal article Mahdi Cheraghchi, Johan Håstad, Marcus Isaksson, Ola Svensson. Approximating Linear Threshold Predicates.	Electronic Colloquium on Computational Complexity (ECCC) 2010, Volume 17	(0)	2010
	Journal article Ola Svensson. Santa Claus Schedules Jobs on Unrelated Machines	CoRR 2010, Volume 0	(0)	2010
	Conference paper Monaldo Mastrolilli, Ola Svensson. Improved Bounds for Flow Shop Scheduling.	Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5-12, 2009, Proceedings, Part I 2009	(0)	2009
	Journal article Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson. Precedence Constraint Scheduling and Connections to Dimension Theory of Partial Orders.	Bulletin of the EATCS 2008, Volume 95	(0)	2008

Show item 1 to 25 of 32  

Your query returned 32 matches in the database.