{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:07:48Z","timestamp":1762099668504},"reference-count":19,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1997,11,1]],"date-time":"1997-11-01T00:00:00Z","timestamp":878342400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1997,11]]},"DOI":"10.1016\/s0020-0190(97)00164-6","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:55:41Z","timestamp":1052783741000},"page":"165-171","source":"Crossref","is-referenced-by-count":66,"title":["On the efficiency of polynomial time approximation schemes"],"prefix":"10.1016","volume":"64","author":[{"given":"Marco","family":"Cesati","sequence":"first","affiliation":[]},{"given":"Luca","family":"Trevisan","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/S0020-0190(97)00164-6_BIB1","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1016\/0168-0072(94)00034-Z","article-title":"Fixed parameter tractability and completeness IV: on completeness for W[P] and PSPACE analogues","volume":"73","author":"Abrahamson","year":"1995","journal-title":"Ann. Pure Appl. Logic"},{"key":"10.1016\/S0020-0190(97)00164-6_BIB2","series-title":"Proc. 37th IEEE Symp. on Foundations of Computer Science","first-page":"2","article-title":"Polynomial time approximation schemes for Euclidean TSP and other geometric problems","author":"Arora","year":"1996"},{"key":"10.1016\/S0020-0190(97)00164-6_BIB3","series-title":"Proc. 38th IEEE Symp. on Foundations of Computer Science","article-title":"Nearly linear time approximation schemes for Euclidean TSP and other geometric problems","author":"Arora","year":"1997"},{"key":"10.1016\/S0020-0190(97)00164-6_BIB4","series-title":"Proc. 27th ACM Symp. on Theory of Computing","first-page":"284","article-title":"Polynomial time approximation schemes for dense instances of NP-hard problems","author":"Arora","year":"1995"},{"key":"10.1016\/S0020-0190(97)00164-6_BIB5","series-title":"Introduction to the Theory of Complexity","author":"Bovet","year":"1993"},{"key":"10.1016\/S0020-0190(97)00164-6_BIB6","series-title":"Proc. 2nd Israel Symp. on Theory of Computing and Systems","first-page":"118","article-title":"On fixed-parameter tractability and approximability of NP-hard optimization problems","author":"Cai","year":"1993"},{"key":"10.1016\/S0020-0190(97)00164-6_BIB7","unstructured":"also: J. Comput. System Sci., to appear."},{"key":"10.1016\/S0020-0190(97)00164-6_BIB8","series-title":"On the parameterized complexity of short computation and factorization, Archive for Mathematical Logic","author":"Cai","year":"1995"},{"key":"10.1016\/S0020-0190(97)00164-6_BIB9","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1002\/malq.19970430204","article-title":"Computation models for parameterized complexity","volume":"43","author":"Cesati","year":"1997","journal-title":"Math. Logic Quart."},{"key":"10.1016\/S0020-0190(97)00164-6_BIB10","series-title":"MAX NP-completeness made easy","author":"Crescenzi","year":"1996"},{"key":"10.1016\/S0020-0190(97)00164-6_BIB11","unstructured":"W.F. de la Vega, MAXCUT has a randomized approximation scheme in dense graphs, Random Structures and Algorithms, to appear."},{"key":"10.1016\/S0020-0190(97)00164-6_BIB12","series-title":"Proc. 7th IEEE Conf. on Structure in Complexity Theory","first-page":"36","article-title":"Fixed-parameter intractability (extended abstract)","author":"Downey","year":"1992"},{"key":"10.1016\/S0020-0190(97)00164-6_BIB13","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1137\/S0097539792228228","article-title":"Fixed-parameter tractability and completeness I: Basic theory","volume":"24","author":"Downey","year":"1995","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(97)00164-6_BIB14","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0304-3975(94)00097-3","article-title":"Fixed-parameter tractability and completeness II: On completeness for W[1]","volume":"141","author":"Downey","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0020-0190(97)00164-6_BIB15","series-title":"Proc. 37th IEEE Symp. on Foundations of Computer Science","article-title":"The regularity lemma and approximation schemes for dense problems","author":"Frieze","year":"1996"},{"key":"10.1016\/S0020-0190(97)00164-6_BIB16","series-title":"Proc. 37th IEEE Symp. on Foundations of Computer Science","article-title":"Property testing and its connection with learning and approximation","author":"Goldreich","year":"1996"},{"issue":"1","key":"10.1016\/S0020-0190(97)00164-6_BIB17","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1145\/7531.7535","article-title":"Using dual approximation algorithms for scheduling problems: Practical and theoretical results","volume":"34","author":"Hochbaum","year":"1987","journal-title":"J. ACM"},{"key":"10.1016\/S0020-0190(97)00164-6_BIB18","series-title":"A linear time approximation scheme for the makespan problem","author":"Hochbaum","year":"1996"},{"key":"10.1016\/S0020-0190(97)00164-6_BIB19","series-title":"Proc. 28th ACM Symp. on Theory of Computing","first-page":"329","article-title":"Towards a syntactic characterization of PTAS","author":"Khanna","year":"1996"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001646?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097001646?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T22:26:51Z","timestamp":1556058411000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097001646"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,11]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,11]]}},"alternative-id":["S0020019097001646"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00164-6","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,11]]}}}