Approximation schemes for a class of subset selection problems

Theoretical Computer Science

Volumn 382, Issue 2, 2007, Pages 151-156

  Pruhs, Kirk ^a   Woeginger, Gerhard J ^b  

^a Learning Research and Development Ctr   (United States)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Approximation algorithm; Approximation scheme; Combinatorial optimization; FPTAS; Pseudo polynomial algorithm; Scheduling theory; Worst case analysis

Indexed keywords

APPROXIMATION ALGORITHMS; BRANCH AND BOUND METHOD; COMBINATORIAL OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; SCHEDULING ALGORITHMS;

APPROXIMATION SCHEMES; PSEUDO-POLYNOMIAL ALGORITHMS; SCHEDULING THEORY; WORST CASE ANALYSIS;

SET THEORY;

EID: 34547496200     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.03.006     Document Type: Article

References (21)

1. Bellman R.E., and Dreyfus S.E. Applied Dynamic Programming (1962), Princeton University Press
2. Cormen T., Leiserson C., Rivest R., and Stein C. Introduction to Algorithms (2001), McGraw-Hill, Boston
3. Ergun F., Sinha R., and Zhang L. An improved FPTAS for restricted shortest path. Information Processing Letters 83 (2002) 287-291
4. Garey M.R., and Johnson D.S. Computers and Intractability (1979), W.H. Freeman and Co., New York
5. Gens G.V., and Levner E.V. Fast approximation algorithms for job sequencing with deadlines. Discrete Applied Mathematics 3 (1981) 313-318
6. Graham R.L., Lawler E.L., Lenstra J.K., and Rinnooy Kan A.H.G. Optimization and approximation in deterministic sequencing and scheduling: A survey. Annals of Discrete Mathematics 5 (1979) 287-326
7. Hassin R. Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research 17 (1992) 36-42
8. 1 - ε{lunate}. Acta Mathematica 182 (1999) 105-142
9. Horowitz E., and Sahni S. Computing partitions with applications to the knapsack problem. Journal of the ACM 21 (1974) 277-292
10. Horowitz E., and Sahni S. Exact and approximate algorithms for scheduling nonidentical processors. Journal of the ACM 23 (1976) 317-327
11. Ibarra O., and Kim C.E. Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM 22 (1975) 463-468
12. Karp R.M. Reducibility among combinatorial problems. In: Miller R.E., and Thatcher J.W. (Eds). Complexity of Computer Computations (1972), Plenum Press, New York 85-104
13. Lawler E.L. Fast approximation schemes for knapsack problems. Mathematics of Operations Research 4 (1979) 339-356
14. Lawler E.L. A dynamic programming algorithm for preemptive scheduling of a single machine to minimize the number of late jobs. Annals of Operations Research 26 (1990) 125-133
15. Lawler E.L., Lenstra J.K., Rinnooy Kan A.H.G., and Shmoys D.B. Sequencing and scheduling: Algorithms and complexity. In: Graves S.C., Rinnooy Kan A.H.G., and Zipkin P.H. (Eds). Logistics of Production and Inventory. Handbooks in Operations Research and Management Science vol. 4 (1993), North-Holland, Amsterdam 445-522
16. Lawler E.L., and Moore J.M. A functional equation and its application to resource allocation and sequencing problems. Management Science 16 (1969) 77-84
17. Lorenz D.H., and Raz D. A simple efficient approximation scheme for the restricted shortest path problem. Operations Research Letters 28 (2001) 213-219
18. Martello S., and Toth P. Knapsack problems: Algorithms and computer implementations (1990), John Wiley & Sons, England
19. Sahni S. Algorithms for scheduling independent tasks. Journal of the ACM 23 (1976) 116-127
20. Warburton A. Approximation of pareto optima in multiple-objective shortest path problems. Operations Research 35 (1987) 70-79
21. Woeginger G.J. When does a dynamic programming formulation guarantee the existence of a fully polynomial time approximation scheme (FPTAS)?. INFORMS Journal on Computing 12 (2000) 57-75