ON THE EXISTENCE OF FAST APPROXIMATION SCHEMES11Supported by Sonderforschungsbereich 21 (DFG), Institut für Operations Research, Universität Bonn.
- 1 January 1981
- book chapter
- Published by Elsevier
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Fast Approximation Algorithms for Knapsack ProblemsMathematics of Operations Research, 1979
- An analysis of approximations for maximizing submodular set functions—IMathematical Programming, 1978
- Approximation Algorithms for Certain Scheduling ProblemsMathematics of Operations Research, 1978
- Lower bounds on the worst-case complexity of some oracle algorithmsDiscrete Mathematics, 1978
- General Techniques for Combinatorial ApproximationOperations Research, 1977
- Approximate algorithms for some generalized knapsack problemsTheoretical Computer Science, 1976
- Exact and Approximate Algorithms for Scheduling Nonidentical ProcessorsJournal of the ACM, 1976
- Algorithms for Scheduling Independent TasksJournal of the ACM, 1976
- Fast Approximation Algorithms for the Knapsack and Sum of Subset ProblemsJournal of the ACM, 1975
- Approximate Algorithms for the 0/1 Knapsack ProblemJournal of the ACM, 1975