{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,8]],"date-time":"2024-07-08T10:48:07Z","timestamp":1720435687006},"reference-count":35,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2015,2,1]],"date-time":"2015-02-01T00:00:00Z","timestamp":1422748800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T00:00:00Z","timestamp":1548979200000},"content-version":"vor","delay-in-days":1461,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1016\/j.scico.2014.07.001","type":"journal-article","created":{"date-parts":[[2014,7,18]],"date-time":"2014-07-18T12:31:00Z","timestamp":1405686660000},"page":"484-515","update-policy":"http:\/\/dx.doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"P4","title":["Approximate by thinning: Deriving fully polynomial-time approximation schemes"],"prefix":"10.1016","volume":"98","author":[{"given":"Shin-Cheng","family":"Mu","sequence":"first","affiliation":[]},{"ORCID":"http:\/\/orcid.org\/0000-0002-9344-0499","authenticated-orcid":false,"given":"Yu-Han","family":"Lyu","sequence":"additional","affiliation":[]},{"given":"Akimasa","family":"Morihata","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/j.scico.2014.07.001_br0010","article-title":"Algebra of Programming","author":"Bird","year":"1997"},{"issue":"4","key":"10.1016\/j.scico.2014.07.001_br0020","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1142\/S0129054105003303","article-title":"Partitioning trees of supply and demand","volume":"16","author":"Ito","year":"2005","journal-title":"Int. J. Found. Comput. Sci."},{"key":"10.1016\/j.scico.2014.07.001_br0030","unstructured":"J. Kleinberg, \u00c9. Tardos, Algorithm Design, Addison-Wesley, 2005."},{"issue":"4","key":"10.1016\/j.scico.2014.07.001_br0040","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1145\/321906.321909","article-title":"Fast approximation algorithms for the knapsack and sum of subset problems","volume":"22","author":"Ibarra","year":"1975","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/j.scico.2014.07.001_br0050","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1145\/321941.321951","article-title":"Exact and approximate algorithms for scheduling nonidentical processors","volume":"23","author":"Horowitz","year":"1976","journal-title":"J. ACM"},{"issue":"3","key":"10.1016\/j.scico.2014.07.001_br0060","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1145\/322077.322090","article-title":"\u201cStrong\u201d NP-completeness results: motivation, examples, and implications","volume":"25","author":"Garey","year":"1978","journal-title":"J. ACM"},{"key":"10.1016\/j.scico.2014.07.001_br0070","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1287\/ijoc.12.1.57.11901","article-title":"When does a dynamic programming formulation guarantee the existence of an FPTAS?","volume":"12","author":"Woeginger","year":"2000","journal-title":"INFORMS J. Comput."},{"key":"10.1016\/j.scico.2014.07.001_br0080","author":"Mu"},{"key":"10.1016\/j.scico.2014.07.001_br0090","series-title":"Workshop on Generic Programming","first-page":"97","article-title":"Constructing datatype-generic fully polynomial-time approximation schemes using generalised thinning","author":"Mu","year":"2010"},{"issue":"9","key":"10.1016\/j.scico.2014.07.001_br0100","doi-asserted-by":"crossref","first-page":"494","DOI":"10.1287\/mnsc.15.9.494","article-title":"Discrete dynamic programming and capital allocation","volume":"15","author":"Nemhauser","year":"1969","journal-title":"Manag. Sci."},{"key":"10.1016\/j.scico.2014.07.001_br0110","series-title":"Algebraic and Coalgebraic Methods in the Mathematics of Program Construction","first-page":"281","article-title":"Algebraic methods for optimization problems","volume":"vol. 2297","author":"Bird","year":"2002"},{"key":"10.1016\/j.scico.2014.07.001_br0120","series-title":"A Logical Approach to Discrete Math","author":"Gries","year":"1993"},{"key":"10.1016\/j.scico.2014.07.001_br0130","series-title":"Proceedings of the IFIP TC2\/WG2.1 Working Conference on Constructing Programs","first-page":"287","article-title":"Relational catamorphisms","author":"Backhouse","year":"1991"},{"key":"10.1016\/j.scico.2014.07.001_br0140","series-title":"Formal Program Development. Proc. IFIP TC2\/WG 2.1 State of the Art Seminar","first-page":"7","article-title":"Elements of a relational theory of datatypes","volume":"vol. 755","author":"Backhouse","year":"1992"},{"key":"10.1016\/j.scico.2014.07.001_br0150","series-title":"Algebraic Methodology and Software Technology","first-page":"303","article-title":"Polynomial relators","author":"Backhouse","year":"1991"},{"key":"10.1016\/j.scico.2014.07.001_br0160","series-title":"Research Topics in Functional Programming","first-page":"287","article-title":"A calculus of functions for program derivation","author":"Bird","year":"1990"},{"issue":"5","key":"10.1016\/j.scico.2014.07.001_br0170","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1017\/S0956796805005642","article-title":"Countdown: a case study in origami programming","volume":"15","author":"Bird","year":"2005","journal-title":"J. Funct. Program."},{"key":"10.1016\/j.scico.2014.07.001_br0180","series-title":"Programming Languages: Implementations, Logics, and Programs","first-page":"1","article-title":"A generic program for sequential decision processes","volume":"vol. 982","author":"de Moor","year":"1995"},{"key":"10.1016\/j.scico.2014.07.001_br0190","series-title":"Complexity and Approximation","author":"Ausiello","year":"1999"},{"key":"10.1016\/j.scico.2014.07.001_br0200","series-title":"Symposium on Principles of Programming Languages","first-page":"470","article-title":"PolyP \u2014 a polytypic programming language extension","author":"Jansson","year":"1997"},{"key":"10.1016\/j.scico.2014.07.001_br0210","series-title":"Symposium on Principles of Programming Languages","first-page":"119","article-title":"A new approach to generic functional programming","author":"Hinze","year":"2000"},{"issue":"1","key":"10.1016\/j.scico.2014.07.001_br0220","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1017\/S0956796807006326","article-title":"Applicative programming with effects","volume":"18","author":"McBride","year":"2008","journal-title":"J. Funct. Program."},{"issue":"4","key":"10.1016\/j.scico.2014.07.001_br0230","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1017\/S0956796801004038","article-title":"Maximum marking problems","volume":"11","author":"Bird","year":"2001","journal-title":"J. Funct. Program."},{"key":"10.1016\/j.scico.2014.07.001_br0240","series-title":"International Conference on Functional Programming","first-page":"137","article-title":"Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems","author":"Sasano","year":"2000"},{"key":"10.1016\/j.scico.2014.07.001_br0250","series-title":"A relational approach to optimization problems","author":"Curtis","year":"1995"},{"key":"10.1016\/j.scico.2014.07.001_br0260","series-title":"IFIP TC2 Working Conference on Algorithmic Languages and Calculi","first-page":"1","article-title":"Dynamic programming: a different perspective","author":"Curtis","year":"1997"},{"key":"10.1016\/j.scico.2014.07.001_br0270","series-title":"ACM SIGPLAN Workshop on Semantics, Applications and Implementation of Program Generation","first-page":"72","article-title":"Generation of efficient programs for solving maximum multi-marking problems","volume":"vol. 2196","author":"Sasano","year":"2001"},{"issue":"1","key":"10.1016\/j.scico.2014.07.001_br0280","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s00354-010-0098-4","article-title":"A short cut to optimal sequences","volume":"29","author":"Morihata","year":"2011","journal-title":"New Gener. Comput."},{"issue":"1","key":"10.1016\/j.scico.2014.07.001_br0290","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.cosrev.2009.11.001","article-title":"A survey on the structure of approximation classes","volume":"4","author":"Escoffier","year":"2010","journal-title":"Comput. Sci. Rev."},{"key":"10.1016\/j.scico.2014.07.001_br0300","series-title":"Genetic and Evolutionary Computation Conference","first-page":"771","article-title":"Evolutionary algorithms and dynamic programming","author":"Doerr","year":"2009"},{"key":"10.1016\/j.scico.2014.07.001_br0310","series-title":"The Design of Approximation Algorithms","author":"Williamson","year":"2011"},{"key":"10.1016\/j.scico.2014.07.001_br0320","series-title":"Nonlinear Programming 4","first-page":"415","article-title":"On the existence of fast approximation schemes","author":"Korte","year":"1981"},{"issue":"1","key":"10.1016\/j.scico.2014.07.001_br0330","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(94)00291-P","article-title":"Approximate solution of NP optimization problems","volume":"150","author":"Ausiello","year":"1995","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.scico.2014.07.001_br0340","series-title":"Symposium on Discrete Algorithms","first-page":"700","article-title":"Fully polynomial time approximation schemes for stochastic dynamic programs","author":"Halman","year":"2008"},{"key":"10.1016\/j.scico.2014.07.001_br0350","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.orl.2009.03.002","article-title":"Fully polynomial approximation schemes for time-cost tradeoff problems in series-parallel project networks","volume":"37","author":"Halman","year":"2009","journal-title":"Oper. Res. Lett."}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642314002974?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642314002974?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T02:56:44Z","timestamp":1548989804000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642314002974"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2]]},"references-count":35,"alternative-id":["S0167642314002974"],"URL":"https:\/\/doi.org\/10.1016\/j.scico.2014.07.001","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[2015,2]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Approximate by thinning: Deriving fully polynomial-time approximation schemes","name":"articletitle","label":"Article Title"},{"value":"Science of Computer Programming","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.scico.2014.07.001","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2014 Elsevier B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}
