Approximation algorithms for scheduling and packing problems

Authors:
Klaus Jansen
Affiliations:
Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Kiel, Germany
Venue:
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Year:
2011

Citing 26
Cited 0

Using dual approximation algorithms for scheduling problems theoretical and practical results

Journal of the ACM (JACM)
A polynomial approximation scheme for scheduling on uniform processors: Using the dual approximation approach

SIAM Journal on Computing
Bin packing with restricted piece sizes

Information Processing Letters
Tighter bound for MULTIFIT scheduling on uniform processors

Discrete Mathematics
Various notions of approximations: good, better, best, and more

Approximation algorithms for NP-hard problems
A Strip-Packing Algorithm with Absolute Performance Bound 2

SIAM Journal on Computing
On the efficiency of polynomial time approximation schemes

Information Processing Letters
Exact and Approximate Algorithms for Scheduling Nonidentical Processors

Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
The Multiple Subset Sum Problem

SIAM Journal on Optimization
Reverse-Fit: A 2-Optimal Algorithm for Packing Rectangles

ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines

Algorithmica
A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem

SIAM Journal on Computing
Improved approximation algorithms for scheduling with fixed jobs

SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Improved Absolute Approximation Ratios for Two-Dimensional Packing Problems

APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
The effect of machine availability on the worst-case performance of LPT

Discrete Applied Mathematics
Parameterized Approximation Scheme for the Multiple Knapsack Problem

SIAM Journal on Computing
An EPTAS for Scheduling Jobs on Uniform Processors: Using an MILP Relaxation with a Constant Number of Integral Variables

SIAM Journal on Discrete Mathematics
Decision Support and Optimization in Shutdown and Turnaround Scheduling

INFORMS Journal on Computing
A (5/3 + ε)-approximation for strip packing

WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Approximation Algorithms for Scheduling Parallel Jobs

SIAM Journal on Computing
A fast approximation scheme for the multiple knapsack problem

SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Scheduling jobs on identical and uniform processors revisited

WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Theoretical investigations on the modified integer round-up property for the one-dimensional cutting stock problem

Operations Research Letters
Faster approximation algorithms for scheduling with fixed jobs

CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Parameterized Complexity and Approximation Algorithms

The Computer Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present an overview about new approximation results for several optimization problems. During the last years we have worked on the design of approximation algorithms with a smaller approximation ratio and on the design of efficient polynomial time approximation schemes with a faster running time. We presented approximation algorithms with a smaller ratio for scheduling with fixed jobs and for two dimensional strip packing. On the other hand, we developed efficient approximation schemes with an improved running time for multiple knapsack and scheduling independent jobs on uniform processors.