skip to main content
10.1145/1863495.1863508acmconferencesArticle/Chapter ViewAbstractPublication PagesicfpConference Proceedingsconference-collections
research-article

Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning

Published: 26 September 2010 Publication History

Abstract

The fully polynomial-time approximation scheme (FPTAS) is a class of approximation algorithms that is able to deliver an approximate solution within any chosen ratio in polynomial time. By generalising Bird and de Moor's Thinning Theorem to a property between three orderings, we come up with a datatype-generic strategy for constructing fold-based FPTASs. Greedy, thinning, and approximation algorithms can thus be seen as a series of generalisations. Components needed in constructing an FPTAS are often natural extensions of those in the thinning algorithm. Design of complex FPTASs is thus made easier, and some of the resulting algorithms turn out to be simpler than those in previous works.

Supplementary Material

MOV File (wgp-1710-mu.mov)

References

[1]
}}S. Arora. Approximation schemes for NP-hard geometric optimization problems: a survey. Mathematical Programming, 97(1-2):43--69, 2003.
[2]
}}G. Ausiello, P. Crescenzi, and M. Protasi. Approximate solution of NP optimization problems. Theoretical Computer Science, 150(1):1--55, 1995.
[3]
}}R. S. Bird. A calculus of functions for program derivation. In D. A. Turner, editor, Research Topics in Functional Programming, University of Texas at Austin Year of Programming Series, pages 287--308. Addison-Wesley, 1990.
[4]
}}R. S. Bird and O. de Moor. Algebra of Programming. International Series in Computer Science. Prentice Hall, 1997.
[5]
}}R. S. Bird, J. Gibbons, and S.-C. Mu. Algebraic methods for optimization problems. In Algebraic and Coalgebraic Methods in the Mathematics of Program Construction, LNCS No. 2297, pages 281--307. Springer-Verlag, 2002.
[6]
}}S. Curtis. A Relational Approach to Optimization Problems. PhD thesis, Oxford University Computing Laboratory, 1995.
[7]
}}O. de Moor. A generic program for sequential decision processes. In Programming Languages: Implementations, Logics, and Programs, LNCS No. 982, pages 1--23. Springer-Verlag, 1995.
[8]
}}M. Erwig and S. L. Peyton Jones. Pattern guards and transformational patterns. Electronic Notes in Theoretical Computer Science, 41(1), 2000.
[9]
}}M. R. Garey and D. S. Johnson. "Strong" NP-completeness results: motivation, examples, and implications. Journal of the ACM, 25(3):499--508, July 1978.
[10]
}}N. Halman, D. Klabjan, C.-L. Li, J. B. Orlin, and D. Simchi-Levi. Fully polynomial time approximation schemes for stochastic dynamic programs. In The Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 700--709. SIAM, 2008.
[11]
}}E. Horowitz and S. Sahni. Exact and approximate algorithms for scheduling nonidentical processors. Journal of the ACM, 23(2):317--327, April 1976.
[12]
}}O. H. Ibarra and C. E. Kim. Fast approximation algorithms for the knapsack and sum of subset problems. Journal of the ACM, 22(4):463--468, October 1975.
[13]
}}T. Ito, X. Zhou, and T. Nishizeki. Partitioning trees of supply and demand. International Journal of Foundations of Computer Science, 16(4):803--827, August 2005.
[14]
}}B. Korte and R. Schrader. On the existence of fast approximation schemes. In Nonlinear Programming, volume 4, pages 415--437. Academic Press, 1981.
[15]
}}S.-C. Mu, Y.-H. Lyu, and A. Morihata. http://www.iis.sinica.edu.tw/~scm/2010/fptas, 2010.
[16]
}}G. J. Woeginger. When does a dynamic programming formulation guarantee the existence of an FPTAS? INFORMS Journal on Computing, 12:57--75, January 2000.

Cited By

View all

Index Terms

  1. Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning

      Recommendations

      Comments

      Information & Contributors

      Information

      Published In

      cover image ACM Conferences
      WGP '10: Proceedings of the 6th ACM SIGPLAN workshop on Generic programming
      September 2010
      116 pages
      ISBN:9781450302517
      DOI:10.1145/1863495
      Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

      Sponsors

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      Published: 26 September 2010

      Permissions

      Request permissions for this article.

      Check for updates

      Author Tags

      1. approximation algorithms
      2. program derivation

      Qualifiers

      • Research-article

      Conference

      ICFP '10
      Sponsor:

      Acceptance Rates

      Overall Acceptance Rate 30 of 43 submissions, 70%

      Upcoming Conference

      ICFP '25
      ACM SIGPLAN International Conference on Functional Programming
      October 12 - 18, 2025
      Singapore , Singapore

      Contributors

      Other Metrics

      Bibliometrics & Citations

      Bibliometrics

      Article Metrics

      • Downloads (Last 12 months)1
      • Downloads (Last 6 weeks)0
      Reflects downloads up to 14 Feb 2025

      Other Metrics

      Citations

      Cited By

      View all

      View Options

      Login options

      View options

      PDF

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Figures

      Tables

      Media

      Share

      Share

      Share this Publication link

      Share on social media