|
Search the dblp DataBase
Ola Svensson:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Ola Svensson, Sergei G. Vorobyov
Linear Programming Polytope and Algorithm for Mean Payoff Games. [Citation Graph (0, 0)][DBLP] AAIM, 2006, pp:64-78 [Conf]
- Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson
Approximating Precedence-Constrained Single Machine Scheduling by Coloring. [Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2006, pp:15-26 [Conf]
- Ola Svensson, Sergei G. Vorobyov
Linear Complementarity and P-Matrices for Stochastic Games. [Citation Graph (0, 0)][DBLP] Ershov Memorial Conference, 2006, pp:409-423 [Conf]
- Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
Scheduling with Precedence Constraints of Low Fractional Dimension. [Citation Graph (0, 0)][DBLP] IPCO, 2007, pp:130-144 [Conf]
Approximating Single Machine Scheduling with Scenarios. [Citation Graph (, )][DBLP]
Approximating Linear Threshold Predicates. [Citation Graph (, )][DBLP]
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. [Citation Graph (, )][DBLP]
(Acyclic) JobShops are Hard to Approximate. [Citation Graph (, )][DBLP]
Improved Bounds for Flow Shop Scheduling. [Citation Graph (, )][DBLP]
Conditional hardness of precedence constrained scheduling on identical machines. [Citation Graph (, )][DBLP]
Search in 0.086secs, Finished in 0.087secs
|