Approximate by thinning: Deriving fully polynomial-time approximation schemes

Shin Cheng Mu, Yu Han Lyu, Akimasa Morihata

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

The fully polynomial-time approximation scheme (FPTAS) is a class of approximation algorithms for optimisation problems 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
Pages (from-to)484-515
Number of pages32
JournalScience of Computer Programming
Volume98
Issue numberP4
DOIs
Publication statusPublished - 2015 Feb 1

Keywords

  • Approximation algorithms
  • Program derivation

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Approximate by thinning: Deriving fully polynomial-time approximation schemes'. Together they form a unique fingerprint.

Cite this