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

Shin Cheng Mu; Yu Han Lyu; Akimasa Morihata

doi:10.1145/1863495.1863508

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

Shin Cheng Mu, Yu Han Lyu, Akimasa Morihata

Research Institute of Electrical Communication (RIEC)

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	WGP'10 - Proceedings of the 2010 ACM SIGPLAN Workshop on Generic Programming, Co-located with ICFP'10
Pages	97-108
Number of pages	12
DOIs	https://doi.org/10.1145/1863495.1863508
Publication status	Published - 2010
Event	6th ACM SIGPLAN Workshop on Generic Programming, WGP 2010 - Baltimore, MD, United States Duration: 2010 Sep 26 → 2010 Sep 26

Publication series

Name	Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

Other

Other	6th ACM SIGPLAN Workshop on Generic Programming, WGP 2010
Country	United States
City	Baltimore, MD
Period	10/9/26 → 10/9/26

Keywords

approximation algorithms
program derivation

ASJC Scopus subject areas

Software

Access to Document

10.1145/1863495.1863508

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

Mu, S. C., Lyu, Y. H., & Morihata, A. (2010). Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning. In WGP'10 - Proceedings of the 2010 ACM SIGPLAN Workshop on Generic Programming, Co-located with ICFP'10 (pp. 97-108). (Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP). https://doi.org/10.1145/1863495.1863508

Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning. / Mu, Shin Cheng; Lyu, Yu Han; Morihata, Akimasa.

WGP'10 - Proceedings of the 2010 ACM SIGPLAN Workshop on Generic Programming, Co-located with ICFP'10. 2010. p. 97-108 (Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Mu, SC, Lyu, YH & Morihata, A 2010, Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning. in WGP'10 - Proceedings of the 2010 ACM SIGPLAN Workshop on Generic Programming, Co-located with ICFP'10. Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP, pp. 97-108, 6th ACM SIGPLAN Workshop on Generic Programming, WGP 2010, Baltimore, MD, United States, 10/9/26. https://doi.org/10.1145/1863495.1863508

Mu SC, Lyu YH, Morihata A. Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning. In WGP'10 - Proceedings of the 2010 ACM SIGPLAN Workshop on Generic Programming, Co-located with ICFP'10. 2010. p. 97-108. (Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP). https://doi.org/10.1145/1863495.1863508

@inproceedings{6769bc99337d44daaf8b41846688119a,

title = "Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning",

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.",

keywords = "approximation algorithms, program derivation",

author = "Mu, {Shin Cheng} and Lyu, {Yu Han} and Akimasa Morihata",

year = "2010",

doi = "10.1145/1863495.1863508",

language = "English",

isbn = "9781450302517",

series = "Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP",

pages = "97--108",

booktitle = "WGP'10 - Proceedings of the 2010 ACM SIGPLAN Workshop on Generic Programming, Co-located with ICFP'10",

}

TY - GEN

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

AU - Mu, Shin Cheng

AU - Lyu, Yu Han

AU - Morihata, Akimasa

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

KW - approximation algorithms

KW - program derivation

UR - http://www.scopus.com/inward/record.url?scp=78449241486&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=78449241486&partnerID=8YFLogxK

U2 - 10.1145/1863495.1863508

DO - 10.1145/1863495.1863508

M3 - Conference contribution

AN - SCOPUS:78449241486

SN - 9781450302517

T3 - Proceedings of the ACM SIGPLAN International Conference on Functional Programming, ICFP

SP - 97

EP - 108

BT - WGP'10 - Proceedings of the 2010 ACM SIGPLAN Workshop on Generic Programming, Co-located with ICFP'10

T2 - 6th ACM SIGPLAN Workshop on Generic Programming, WGP 2010

Y2 - 26 September 2010 through 26 September 2010

ER -

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

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this