| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Klaus Jansen, Roberto Solis-Oba |
Packing Squares with Profits.  |
SIAM J. Discrete Math.  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Hu Zhang |
Scheduling malleable tasks with precedence constraints. |
J. Comput. Syst. Sci. |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen |
A Fast Approximation Scheme for the Multiple Knapsack Problem. |
SOFSEM |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Roberto Solis-Oba |
A simple OPT+1 algorithm for cutting stock under the modified integer round-up property assumption. |
Inf. Process. Lett. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Claire Mathieu, Hadas Shachnai, Neal E. Young |
Packing and Scheduling Algorithms for Information and Communication Services (Dagstuhl Seminar 11091). |
Dagstuhl Reports |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Rolf Harren, Klaus Jansen, Lars Prädel, Rob van Stee |
A (5/3 + ε)-Approximation for Strip Packing. |
WADS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Robenek, Denis Trystram |
Scheduling Jobs on Heterogeneous Platforms. |
COCOON |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Roberto Solis-Oba (eds.) |
Approximation and Online Algorithms - 8th International Workshop, WAOA 2010, Liverpool, UK, September 9-10, 2010. Revised Papers |
WAOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Christina Robenek |
Scheduling Jobs on Identical and Uniform Processors Revisited. |
WAOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen |
Approximation Algorithms for Scheduling and Packing Problems. |
WAOA |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Leslie Ann Goldberg, Klaus Jansen, R. Ravi, José D. P. Rolim (eds.) |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques - 14th International Workshop, APPROX 2011, and 15th International Workshop, RANDOM 2011, Princeton, NJ, USA, August 17-19, 2011. Proceedings |
APPROX-RANDOM |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Roberto Solis-Oba |
Approximation Schemes for Scheduling Jobs with Chain Precedence Constraints. |
Int. J. Found. Comput. Sci. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram |
Approximation Algorithms for Scheduling with Reservations. |
Algorithmica |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen |
An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables. |
SIAM J. Discrete Math. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff |
Trimming of Graphs, with Application to Point Labeling. |
Theory Comput. Syst. |
2010 |
DBLP BibTeX RDF |
|
| 1 | Klaus Jansen, Ralf Thöle |
Approximation Algorithms for Scheduling Parallel Jobs. |
SIAM J. Comput. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram |
A Fast 5/2-Approximation Algorithm for Hierarchical Scheduling. |
Euro-Par |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Stefan Kratsch, Dániel Marx, Ildikó Schlotter |
Bin Packing with Fixed Number of Bins Revisited. |
SWAT |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram |
Approximating the Non-contiguous Multiple Organization Packing Problem. |
IFIP TCS |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Roberto Solis-Oba |
An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths. |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Klaus Jansen (eds.) |
Approximation and Online Algorithms, 7th International Workshop, WAOA 2009, Copenhagen, Denmark, September 10-11, 2009. Revised Papers |
WAOA |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Maria J. Serna, Ronen Shaltiel, Klaus Jansen, José D. P. Rolim (eds.) |
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 |
APPROX-RANDOM |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Roberto Solis-Oba |
Rectangle packing with one-dimensional resource augmentation. |
Discrete Optimization |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen |
Parameterized Approximation Scheme for the Multiple Knapsack Problem. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Erlebach, Klaus Jansen, Christos Kaklamanis, Giuseppe Persiano |
Directed Tree Networks. |
Encyclopedia of Optimization |
2009 |
DBLP DOI BibTeX RDF |
Bipartite edge coloring, Approximation algorithms, Optical networks, Path coloring |
| 1 | Florian Diedrich, Klaus Jansen |
Improved approximation algorithms for scheduling with fixed jobs. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen |
Parameterized approximation scheme for the multiple knapsack problem. |
SODA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen |
An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables. |
ICALP |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Lars Prädel, Ulrich M. Schwarz |
Two for One: Tight Approximation of 2D Bin Packing. |
WADS |
2009 |
DBLP DOI BibTeX RDF |
approximation, bin packing, rectangle packing |
| 1 | Marin Bougeret, Pierre-François Dutot, Klaus Jansen, Christina Otte, Denis Trystram |
Approximation Algorithms for Multiple Strip Packing. |
WAOA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz, Denis Trystram |
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability. |
Algorithmics of Large and Complex Networks |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Irit Dinur, Klaus Jansen, Joseph Naor, José D. P. Rolim (eds.) |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August 21-23, 2009. Proceedings |
APPROX-RANDOM |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Nikhil Bansal, Alberto Caprara, Klaus Jansen, Lars Prädel, Maxim Sviridenko |
A Structural Lemma in 2-Dimensional Packing, and Its Implications on Approximability. |
ISAAC |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli |
Grouping Techniques for Scheduling Problems: Simpler and Faster. |
Algorithmica |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba |
On Packing Rectangles with Resource Augmentation: Maximizing the Profit. |
Algorithmic Operations Research |
2008 |
DBLP BibTeX RDF |
|
| 1 | Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff |
Trimming of Graphs, with Application to Point Labeling |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas |
Approximation Algorithms for 3D Orthogonal Knapsack. |
J. Comput. Sci. Technol. |
2008 |
DBLP DOI BibTeX RDF |
geometric configurations, approximation algorithm, computational and structural complexity |
| 1 | Klaus Jansen, Hu Zhang |
Approximation algorithms for general packing problems and their application to the multicast congestion problem. |
Math. Program. |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 68W25, 90C25, 90C05, 68W40, 68M10 |
| 1 | Klaus Jansen, Marian Margraf |
Approximative Algorithmen und Nichtapproximierbarkeit. |
|
2008 |
RDF |
|
| 1 | Klaus Jansen, Ralf Thöle |
Approximation Algorithms for Scheduling Parallel Jobs: Breaking the Approximation Ratio of 2. |
ICALP |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff |
Trimming of Graphs, with Application to Point Labeling. |
STACS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Roberto Solis-Oba |
A Polynomial Time Approximation Scheme for the Square Packing Problem. |
IPCO |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashish Goel, Klaus Jansen, José D. P. Rolim, Ronitt Rubinfeld (eds.) |
Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques, 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings |
APPROX-RANDOM |
2008 |
DBLP BibTeX RDF |
|
| 1 | Florian Diedrich, Klaus Jansen |
Faster and simpler approximation algorithms for mixed packing and covering problems. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Janka Chlebíková, Klaus Jansen |
The d-precoloring problem for k-degenerate graphs. |
Discrete Mathematics |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Guochuan Zhang |
Maximizing the Total Profit of Rectangles Packed into a Rectangle. |
Algorithmica |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Diedrich, Klaus Jansen, Fanny Pascual, Denis Trystram |
Approximation Algorithms for Scheduling with Reservations. |
HiPC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen |
Approximation Algorithms for Geometric Intersection Graphs. |
WG |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, Henning Thomas |
Approximation Algorithms for 3D Orthogonal Knapsack. |
TAMC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Roberto Solis-Oba |
New Approximability Results for 2-Dimensional Packing Problems. |
MFCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad |
07211 Abstracts Collection - Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes. |
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes |
2007 |
DBLP BibTeX RDF |
|
| 1 | Andreas Brandstädt, Klaus Jansen, Dieter Kratsch, Jeremy Spinrad (eds.) |
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05. - 25.05.2007 |
Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes |
2007 |
DBLP BibTeX RDF |
|
| 1 | Florian Diedrich, Klaus Jansen |
An Approximation Algorithm for the General Mixed Packing and Covering Problem. |
ESCAPE |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Moses Charikar, Klaus Jansen, Omer Reingold, José D. P. Rolim (eds.) |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 10th International Workshop, APPROX 2007, and 11th International Workshop, RANDOM 2007, Princeton, NJ, USA, August 20-22, 2007, Proceedings |
APPROX-RANDOM |
2007 |
DBLP BibTeX RDF |
|
| 1 | Klaus Jansen |
Approximation Algorithm for the Mixed Fractional Packing and Covering Problem. |
SIAM Journal on Optimization |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Roberto Solis-Oba |
Preface. |
Theor. Comput. Sci. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Hu Zhang |
An approximation algorithm for scheduling malleable tasks under general precedence constraints. |
ACM Transactions on Algorithms |
2006 |
DBLP DOI BibTeX RDF |
malleable tasks, scheduling, Approximation algorithms, precedence constraints |
| 1 | Klaus Jansen, Lorant Porkolab |
On PreemptiveResource Constrained Scheduling: Polynomial-Time Approximation Schemes. |
SIAM J. Discrete Math. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Evripidis Bampis, Klaus Jansen |
Introduction. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen |
An approximation algorithm for the general max-min resource sharing problem. |
Math. Program. |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Roberto Solis-Oba |
An asymptotic approximation algorithm for 3D-strip packing. |
SODA |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Mihhail Aizatulin, Florian Diedrich, Klaus Jansen |
Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem. |
WEA |
2006 |
DBLP DOI BibTeX RDF |
Evaluation and Fine-tuning, Testing, Implementation, Mathematical Programming, Algorithm Engineering |
| 1 | Josep Díaz, Klaus Jansen, José D. P. Rolim, Uri Zwick (eds.) |
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and 10th International Workshop on Randomization and Computation, RANDOM 2006, Barcelona, Spain, August 28-30 2006, Proceedings |
APPROX-RANDOM |
2006 |
DBLP BibTeX RDF |
|
| 1 | Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba |
Approximation algorithms for flexible job shop problems. |
Int. J. Found. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Monaldo Mastrolilli, Roberto Solis-Oba |
Approximation schemes for job shop scheduling problems with controllable processing times. |
European Journal of Operational Research |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Erlebach, Klaus Jansen |
Conversion of coloring algorithms into maximum weight independent set algorithms. |
Discrete Applied Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Thomas Erlebach, Klaus Jansen, Eike Seidel |
Polynomial-Time Approximation Schemes for Geometric Intersection Graphs. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Marek Karpinski, Andrzej Lingas, Eike Seidel |
Polynomial Time Approximation Schemes for MAX-BISECTION on Planar and Geometric Graphs. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Lorant Porkolab |
General Multiprocessor Task Scheduling: Approximate Solutions in Linear Time. |
SIAM J. Comput. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksei V. Fishkin, Klaus Jansen, Sergey V. Sevastianov, René Sitters |
Preemptive Scheduling of Independent Jobs on Identical Parallel Machines Subject to Migration Delays. |
ESA |
2005 |
DBLP DOI BibTeX RDF |
identical machines, migration delay, scheduling, preemption |
| 1 | Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba |
Packing Weighted Rectangles into a Square. |
MFCS |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, Roberto Solis-Oba |
On Packing Squares with Resource Augmentation: Maximizing the Profit. |
CATS |
2005 |
DBLP BibTeX RDF |
|
| 1 | Klaus Jansen, Hu Zhang |
Scheduling malleable tasks with precedence constraints. |
SPAA |
2005 |
DBLP DOI BibTeX RDF |
malleable tasks, scheduling, approximation algorithms, precedence constraints |
| 1 | Chandra Chekuri, Klaus Jansen, José D. P. Rolim, Luca Trevisan (eds.) |
Approximation, Randomization and Combinatorial Optimization, Algorithms and Techniques, 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2005 and 9th InternationalWorkshop on Randomization and Computation, RANDOM 2005, Berkeley, CA, USA, August 22-24, 2005, Proceedings |
APPROX-RANDOM |
2005 |
DBLP BibTeX RDF |
|
| 1 | Aleksei V. Fishkin, Olga Gerber, Klaus Jansen |
On Efficient Weighted Rectangle Packing with Large Resources. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
approximation, resources, rectangle packing |
| 1 | Klaus Jansen, Hu Zhang |
An Approximation Algorithm for Scheduling Malleable Tasks Under General Precedence Constraints. |
ISAAC |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Rob van Stee |
On strip packing With rotations. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
rotations, approximation scheme, strip packing |
| 1 | Klaus Jansen |
Scheduling Malleable Parallel Tasks: An Asymptotic Fully Polynomial Time Approximation Scheme. |
Algorithmica |
2004 |
DBLP DOI BibTeX RDF |
Malleable tasks, Scheduling, Approximation algorithms |
| 1 | Klaus Jansen, Lorant Porkolab |
Preemptive Scheduling with Dedicated Processors: Applications of Fractional Graph Coloring. |
J. Scheduling |
2004 |
DBLP DOI BibTeX RDF |
fractional graph coloring, scheduling, dedicated processors |
| 1 | Klaus Jansen, Monaldo Mastrolilli |
Approximation schemes for parallel machine scheduling problems with controllable processing times. |
Computers & OR |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Guochuan Zhang |
On rectangle packing: maximizing benefits. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen |
Approximation Algorithms for the General Max-min Resource Sharing Problem: Faster and Simpler. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Guochuan Zhang |
Maximizing the Number of Packed Rectangles. |
SWAT |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen |
Approximation Algorithms for Mixed Fractional Packing and Covering Problems. |
IFIP TCS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Aleksei V. Fishkin, Olga Gerber, Klaus Jansen |
On Weighted Rectangle Packing with Large Resources. |
IFIP TCS |
2004 |
DBLP BibTeX RDF |
|
| 1 | Klaus Jansen, Roberto Solis-Oba (eds.) |
Approximation and Online Algorithms, First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers |
WAOA |
2004 |
DBLP BibTeX RDF |
|
| 1 | Klaus Jansen |
Approximation Algorithms for Mixed Fractional Packing and Covering Problems. |
WAOA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Sanjeev Khanna, José D. P. Rolim, Dana Ron (eds.) |
Approximation, Randomization, and Combinatorial Optimization, Algorithms and Techniques, 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004, and 8th International Workshop on Randomization and Computation, RANDOM 2004, Cambridge, MA, USA, August 22-24, 2004, Proceedings |
APPROX-RANDOM |
2004 |
DBLP BibTeX RDF |
|
| 1 | Klaus Jansen, Roberto Solis-Oba |
An asymptotic fully polynomial time approximation scheme for bin covering. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen |
Approximate strong separation with application in fractional graph coloring and preemptive scheduling. |
Theor. Comput. Sci. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Samir Khuller |
Guest Editors' Introduction. |
Algorithmica |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen |
The mutual exclusion scheduling problem for permutation and comparability graphs. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jirí Fiala, Klaus Jansen, Van Bang Le, Eike Seidel |
Graph Subcolorings: Complexity and Algorithms. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Klaus Jansen, Roberto Solis-Oba, Maxim Sviridenko |
Makespan Minimization in Job Shops: A Linear Time Approximation Scheme. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Klaus Jansen, Lorant Porkolab |
Computing optimal preemptive schedules for parallel tasks: linear programming approaches. |
Math. Program. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Klaus Jansen, Roberto Solis-Oba |
Approximation Algorithms for Scheduling Jobs with Chain Precedence Constraints. |
PPAM |
2003 |
DBLP DOI BibTeX RDF |
scheduling, Approximation algorithm, constraints, chains |
| 1 | Klaus Jansen, Marian Margraf, Monaldo Mastrolilli, José D. P. Rolim (eds.) |
Experimental and Efficient Algorithms, Second International Workshop, WEA 2003, Ascona, Switzerland, May 26-28, 2003, Proceedings |
WEA |
2003 |
DBLP BibTeX RDF |
|
| 1 | Sanjeev Arora, Klaus Jansen, José D. P. Rolim, Amit Sahai (eds.) |
Approximation, Randomization, and Combinatorial Optimization: Algorithms and Techniques, 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003 and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003, Proceedings |
RANDOM-APPROX |
2003 |
DBLP BibTeX RDF |
|
| 1 | Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli |
On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates. |
ISAAC |
2003 |
DBLP DOI BibTeX RDF |
scheduling, Approximation, PTAS, job shop |
| 1 | Klaus Jansen, Lorant Porkolab |
Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks. |
Algorithmica |
2002 |
DBLP DOI BibTeX RDF |
Scheduling, Approximation algorithms, Linear programming |
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")