Article

Free access

When does a dynamic programming formulation guarantee the existence of an FPTAS?

Author:

Gerhard J. WoegingerAuthors Info & Claims

SODA '99: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

Pages 820 - 829

Published: 01 January 1999 Publication History

PDF eReader

References

[1]

G. AUSIELLO, P. CRESCENZI, AND M. PROTASI, Approximate solution of NP optimization problems, Theoretical Computer Science 150, 1995, 1-55.

Digital Library

Google Scholar

[2]

G. AUSmLLO, A. D'ATru, AND M. PRO;rASI, Structure preserving reductions among convex optimization problems, Journal of Computer and Systems Sciences 21, 1980, 136--153.

Google Scholar

[3]

G. AUSlELLO, A. MARCHETTI-SPACCAMELA, AND M. PROTASl, Toward a unified approach for the classification of NP-complete optimization problem, Theoretical Computer Science 12, 1980, 83-96.

Google Scholar

[4]

P. BRUCKErt AND M.Y. KOVALYOV, Single machine batch scheduling to mimmize the weighted number of late jobs, ZOR - Mathematical Methods of Operations Research 43, 1996, 1-8.

Google Scholar

[5]

Z.-L. CHErt, Parallel machine scheduling with time dependent processing times, Discrete Applied Mathematics 70, 1996, 81-93.

Digital Library

Google Scholar

[6]

M.R. GArmY AND D.S. JOHNSON, 'Strong' NP- completeness results: motivation, examples, and implications, Journal of the A CM 25, 1978, 499-508.

Digital Library

Google Scholar

[7]

M.l=t. GAREY AND D.S.JOHNSON, Computers and Intractability: A Guide to the Theory of NP- Completeness, Freeman, San Francisco, 1979.

Digital Library

Google Scholar

[8]

G.V. GEN$ AND E.V. LEVNER, Fast approximation algorithms for job sequencing with deadlines, Discrete Applied Mathematics 3, 1981, 313-318.

Google Scholar

[9]

N.G. HALL AND M.E. Posr#Ert, Earhness-tardiness scheduling problems, I: weighted deviation of completion times about a common due date, Operations Research 39, 1991, 836-846.

Digital Library

Google Scholar

[10]

E. HOROWITZ AND S. SAHNI, Computing partitions with applications to the knapsack problem: Journal of the A CM 21, 1974, 277-292.

Digital Library

Google Scholar

[11]

E. HoRowrrz AND S. SAHNI, Exact and approximate algorithms for scheduling nonidentical processors, Journal of the ACM 23, 1976, 317-327.

Digital Library

Google Scholar

[12]

O. IBAR.rtA AND C.E. KIM, Fast approximation algorithms for the knapsack and sum of subset problems, Journal of the A CM 22, 1975, 463-468.

Digital Library

Google Scholar

[13]

B. 3URISCH, W. KUBIAK, AND J.JOZEFOWSKA, Algorithms for minclique scheduling problems, Discrete Applied Mathematics 72, 1997, 115-139.

Digital Library

Google Scholar

[14]

R.M. KARl', Reducibility among combinatorial problems, in R.E. Miller and J.W. Thatcher, editors, Complexity of Computer Computations, Plenum Press, New York, 1972, 85-104.

Google Scholar

[15]

M.Y. KOVALYOV AND W. KUBt#K, A fully polynomial time approximation scheme for the weighted earlinesstardiness problem, 1997. To appear in Operations Research.

Digital Library

Google Scholar

[16]

M.Y. Kov#mYOV AND W. KUBIAK, A fully polynomial time approximation scheme for minimizing makespan of deteriorating jobs, Journal o/ Heuristics 3, 1998, 287-297.

Digital Library

Google Scholar

[17]

M.Y. KOVALYOV, C.N. POTTS, AND L.N. VAN WASSENHOVE, A fully polynomial approximation scheme for scheduling a single machine to minimize total weighted late work, Mathematics of Operations Research 19, 1994, 86-93.

Digital Library

Google Scholar

[18]

E.L. LAWLErt, .J.K. LENSTRA, A.H.G. RaNNOOY KAN, Arid D.B. SHMOYS, Sequencing and scheduling: Algorithras and complexity, in: S.C. Graves, A.H.G. Rinnooy Kan, and P.H. Zipkin (eds.) Logistics of Production and Inventory, Handbooks in Operations Research and Management Science 4, North-Holland, Amsterdam, 1993, 445-522.

Google Scholar

[19]

.J.K. LENSTrtA, unpublished manuscript, Berkeley, 1977.

Google Scholar

[20]

A. PAz AND S. MORAN, Non deterministic polynomial optimization problems and their approximations, Theoretical Computer Science 15, 1981, 251-277.

Google Scholar

[21]

C.N. POTTS AND L.N. VAN WASSENHOVE, Approximation algorithms for scheduling a single machine to minimize total late work, Operations Research Letters 11, 1992, 261-266.

Digital Library

Google Scholar

[22]

S. SAHNI, Algorithms for scheduling independent tasks, Journal of the A CM 23, 1976, 116-127.

Digital Library

Google Scholar

Cited By

View all

Schieber BShachnai HTamir GTamir T(2018)A Theory and Algorithms for Combinatorial ReoptimizationAlgorithmica10.1007/s00453-017-0274-880:2(576-607)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1007/s00453-017-0274-8
Elbassioni KNguyen T(2017)Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositionsDiscrete Applied Mathematics10.1016/j.dam.2017.06.020230:C(56-70)Online publication date: 30-Oct-2017
https://dl.acm.org/doi/10.1016/j.dam.2017.06.020
Breugem TDollevoet Tvan den Heuvel W(2017)Analysis of FPTASes for the multi-objective shortest path problemComputers and Operations Research10.1016/j.cor.2016.06.02278:C(44-58)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1016/j.cor.2016.06.022
Show More Cited By

Index Terms

When does a dynamic programming formulation guarantee the existence of an FPTAS?
1. Mathematics of computing
  1. Discrete mathematics
  2. Mathematical analysis
    1. Mathematical optimization
2. Theory of computation
  1. Design and analysis of algorithms
    1. Algorithm design techniques
      1. Dynamic programming
    2. Mathematical optimization
  2. Randomness, geometry and discrete structures

Recommendations

When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

<P>We derive results of the following flavor: If a combinatorial optimization problem can be formulated via a dynamic program of a certain structure and if the involved cost and transition functions satisfy certain arithmetical and structural conditions,...
Mixed Integer Linear Programming Formulation Techniques

A wide range of problems can be modeled as Mixed Integer Linear Programming (MIP) problems using standard formulation techniques. However, in some cases the resulting MIP can be either too weak or too large to be effectively solved by state of the art ...
A compact linear programming formulation of the maximum concurrent flow problem

We present an alternative linear programming formulation of the maximum concurrent flow problem MCFP termed the triples formulation. The standard formulations in the literature are the edge-path and node-edge formulations, which are known to be ...

Comments

Information & Contributors

Information

Published In

SODA '99: Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms

January 1999

992 pages

ISBN:0898714346

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 01 January 1999

Check for updates

Qualifiers

Article

Conference

SODA99

Sponsor:

SIGACT
SIAM

SODA99: 1999 10th Conference on Discrete Algorithms

January 17 - 19, 1999

Maryland, Baltimore, USA

Acceptance Rates

Overall Acceptance Rate 411 of 1,322 submissions, 31%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
150
Total Downloads

Downloads (Last 12 months)52
Downloads (Last 6 weeks)7

Reflects downloads up to 04 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Schieber BShachnai HTamir GTamir T(2018)A Theory and Algorithms for Combinatorial ReoptimizationAlgorithmica10.1007/s00453-017-0274-880:2(576-607)Online publication date: 1-Feb-2018
https://dl.acm.org/doi/10.1007/s00453-017-0274-8
Elbassioni KNguyen T(2017)Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositionsDiscrete Applied Mathematics10.1016/j.dam.2017.06.020230:C(56-70)Online publication date: 30-Oct-2017
https://dl.acm.org/doi/10.1016/j.dam.2017.06.020
Breugem TDollevoet Tvan den Heuvel W(2017)Analysis of FPTASes for the multi-objective shortest path problemComputers and Operations Research10.1016/j.cor.2016.06.02278:C(44-58)Online publication date: 1-Feb-2017
https://dl.acm.org/doi/10.1016/j.cor.2016.06.022
Elbassioni KNguyen T(2015)Approximation Schemes for Multi-objective Optimization with Quadratic Constraints of Fixed CP-RankProceedings of the 4th International Conference on Algorithmic Decision Theory - Volume 934610.1007/978-3-319-23114-3_17(273-287)Online publication date: 27-Sep-2015
https://dl.acm.org/doi/10.1007/978-3-319-23114-3_17
Nithyanand RJohnson RSadeghi AForesti S(2013)The password allocation problemProceedings of the 12th ACM workshop on Workshop on privacy in the electronic society10.1145/2517840.2517870(255-260)Online publication date: 4-Nov-2013
https://dl.acm.org/doi/10.1145/2517840.2517870
Balasubramanian SDesmarais RMüller HStege UVenkatesh SGiese HCheng B(2011)Characterizing problems for realizing policies in self-adaptive and self-managing systemsProceedings of the 6th International Symposium on Software Engineering for Adaptive and Self-Managing Systems10.1145/1988008.1988019(70-79)Online publication date: 23-May-2011
https://dl.acm.org/doi/10.1145/1988008.1988019
Afrati FMilis I(2006)Designing PTASs for MIN-SUM scheduling problemsDiscrete Applied Mathematics10.5555/1141038.1705262154:4(622-639)Online publication date: 15-Mar-2006
https://dl.acm.org/doi/10.5555/1141038.1705262
Coffman ELueker GKosaraju S(2001)Approximation algorithms for extensible bin packingProceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms10.5555/365411.365541(586-588)Online publication date: 9-Jan-2001
https://dl.acm.org/doi/10.5555/365411.365541
Schuurman PWoeginger GShmoys D(2000)Scheduling a pipelined operator graphProceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms10.5555/338219.338253(207-212)Online publication date: 1-Feb-2000
https://dl.acm.org/doi/10.5555/338219.338253
Skutella MWoeginger GVitter JLarmore LLeighton T(1999)A PTAS for minimizing the weighted sum of job completion times on parallel machinesProceedings of the thirty-first annual ACM symposium on Theory of Computing10.1145/301250.301356(400-407)Online publication date: 1-May-1999
https://dl.acm.org/doi/10.1145/301250.301356

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

Mixed Integer Linear Programming Formulation Techniques

A compact linear programming formulation of the maximum concurrent flow problem