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
N1 - Copyright:
Copyright 2010 Elsevier B.V., All rights reserved.
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 -