Approximate by thinning: Deriving fully polynomial-time approximation schemes

Shin Cheng Mu, Yu Han Lyu, Akimasa Morihata

研究成果: Article査読

1 被引用数 (Scopus)

抄録

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.

本文言語English
ページ(範囲)484-515
ページ数32
ジャーナルScience of Computer Programming
98
P4
DOI
出版ステータスPublished - 2015 2月 1

ASJC Scopus subject areas

  • ソフトウェア

フィンガープリント

「Approximate by thinning: Deriving fully polynomial-time approximation schemes」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル