|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 3 occurrences of 3 keywords
|
|
|
|
|
Results
Found 21 publication records. Showing 21 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Mahdi Cheraghchi, Johan Håstad, Marcus Isaksson, Ola Svensson |
Approximating Linear Threshold Predicates.  |
TOCT  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli, Ola Svensson |
Hardness of Approximating Flow and Job Shop Scheduling Problems. |
J. ACM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Mömke, Ola Svensson |
Approximating Graphic TSP by Matchings |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson |
Inapproximability Results for Maximum Edge Biclique, Minimum Linear Arrangement, and Sparsest Cut. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ola Svensson |
Hardness of Precedence Constrained Scheduling on Identical Machines. |
SIAM J. Comput. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Tobias Mömke, Ola Svensson |
Approximating Graphic TSP by Matchings. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Ola Svensson |
Santa Claus schedules jobs on unrelated machines. |
STOC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | Mahdi Cheraghchi, Johan Håstad, Marcus Isaksson, Ola Svensson |
Approximating Linear Threshold Predicates. |
Electronic Colloquium on Computational Complexity (ECCC) |
2010 |
DBLP BibTeX RDF |
|
| 1 | Ola Svensson |
Santa Claus Schedules Jobs on Unrelated Machines |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Mahdi Cheraghchi, Johan Håstad, Marcus Isaksson, Ola Svensson |
Approximating Linear Threshold Predicates. |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Ola Svensson |
Conditional hardness of precedence constrained scheduling on identical machines. |
STOC |
2010 |
DBLP DOI BibTeX RDF |
scheduling, approximation, inapproximability |
| 1 | Monaldo Mastrolilli, Ola Svensson |
Improved Bounds for Flow Shop Scheduling. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP BibTeX RDF |
|
| 1 | Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson |
Approximating Single Machine Scheduling with Scenarios. |
APPROX-RANDOM |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Monaldo Mastrolilli, Ola Svensson |
(Acyclic) JobShops are Hard to Approximate. |
FOCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson |
Scheduling with Precedence Constraints of Low Fractional Dimension. |
IPCO |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson |
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Ola Svensson, Sergei G. Vorobyov |
Linear Programming Polytope and Algorithm for Mean Payoff Games. |
AAIM |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Ola Svensson, Sergei G. Vorobyov |
Linear Complementarity and P-Matrices for Stochastic Games. |
Ershov Memorial Conference |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson |
Approximating Precedence-Constrained Single Machine Scheduling by Coloring. |
APPROX-RANDOM |
2006 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #21 of 21 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")