• Corpus ID: 18077378

Approximation Schemes – A Tutorial 1

@inproceedings{Schuurman2009ApproximationS,
  title={Approximation Schemes – A Tutorial 1},
  author={Petra Schuurman and Gerhard J. Woeginger},
  year={2009}
}

References

SHOWING 1-10 OF 79 REFERENCES
Using dual approximation algorithms for scheduling problems: Theoretical and practical results
  • D. HochbaumD. Shmoys
  • Computer Science
    26th Annual Symposium on Foundations of Computer Science (sfcs 1985)
  • 1985
TLDR
A new approach to constructing approximation algorithms, which the aim is find superoptimal, but infeasible solutions, and the performance is measured by the degree of infeasibility allowed, which should find wide applicability for any optimization problem where traditional approximation algorithms have been particularly elusive.
A fully polynomial approximation scheme for the total tardiness problem
Bin packing can be solved within 1 + ε in linear time
For any listL ofn numbers in (0, 1) letL* denote the minimum number of unit capacity bins needed to pack the elements ofL. We prove that, for every positive ε, there exists anO(n)-time algorithmS
Non Deterministic Polynomial Optimization Problems and their Approximations
Analysis of a linear programming heuristic for scheduling unrelated parallel machines
  • C. Potts
  • Business, Computer Science
    Discret. Appl. Math.
  • 1985
Sequencing and scheduling: algorithms and complexity
TLDR
This survey focuses on the area of deterministic machine scheduling, and reviews complexity results and optimization and approximation algorithms for problems involving a single machine, parallel machines, open shops, flow shops and job shops.
Approximate Solution of NP Optimization Problems
Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
TLDR
This paper shows the existence of fully polynomial approximation schemes for single-item capacitated lot-sizing problems, and discusses important special cases of the model and extensions of the approximation scheme to even more general models.
...
...