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

Shin Cheng Mu, Yu Han Lyu, Akimasa Morihata

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationWGP'10 - Proceedings of the 2010 ACM SIGPLAN Workshop on Generic Programming, Co-located with ICFP'10
Pages97-108
Number of pages12
DOIs
Publication statusPublished - 2010
Event6th ACM SIGPLAN Workshop on Generic Programming, WGP 2010 - Baltimore, MD, United States
Duration: 2010 Sep 262010 Sep 26

Publication series

NameProceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Other

Other6th ACM SIGPLAN Workshop on Generic Programming, WGP 2010
CountryUnited States
CityBaltimore, MD
Period10/9/2610/9/26

Keywords

  • approximation algorithms
  • program derivation

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning'. Together they form a unique fingerprint.

Cite this