{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,15]],"date-time":"2026-06-15T18:57:15Z","timestamp":1781549835127,"version":"3.54.5"},"reference-count":17,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1996,5,1]],"date-time":"1996-05-01T00:00:00Z","timestamp":830908800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6286,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1996,5]]},"DOI":"10.1016\/0304-3975(95)00060-7","type":"journal-article","created":{"date-parts":[[2003,5,1]],"date-time":"2003-05-01T01:37:28Z","timestamp":1051753048000},"page":"117-141","source":"Crossref","is-referenced-by-count":61,"title":["On an approximation measure founded on the links between optimization and polynomial approximation theory"],"prefix":"10.1016","volume":"158","author":[{"given":"Marc","family":"Demange","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(95)00060-7_BIB1","series-title":"Sem. IRIA","article-title":"A new evaluation function for approximation algorithms","author":"Aiello","year":"1977"},{"key":"10.1016\/0304-3975(95)00060-7_BIB2","series-title":"Proc. FOCS'92","first-page":"14","article-title":"Proof verification and intractability of approximation problems","author":"Arora","year":"1992"},{"key":"10.1016\/0304-3975(95)00060-7_BIB3","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/0022-0000(80)90046-X","article-title":"Structure preserving reductions among convex optimization problems","volume":"21","author":"Ausiello","year":"1980","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(95)00060-7_BIB4","series-title":"Graphs and Hypergraphs","author":"Berge","year":"1973"},{"key":"10.1016\/0304-3975(95)00060-7_BIB5","series-title":"Random Graphs","author":"Bollob\u00e1s","year":"1985"},{"key":"10.1016\/0304-3975(95)00060-7_BIB6","article-title":"Approximation polynomiale de probl\u00e8mes NP-complets et programmation lin\u00e9aire: une nouvelle mesure d'approximation et algorithmes","author":"Demange","year":"1994"},{"issue":"I","key":"10.1016\/0304-3975(95)00060-7_BIB7","first-page":"289","article-title":"Quelques r\u00e9sultats dans le cadre d'une nouvelle th\u00e9orie de l'approximation polynomiale","volume":"318","author":"Demange","year":"1994","journal-title":"Comptes Rendus de l'Acad\u00e9mie des Sciences de Paris"},{"issue":"I","key":"10.1016\/0304-3975(95)00060-7_BIB8","first-page":"409","article-title":"Quelques \u00e9tapes vers la conciliation de la th\u00e9orie d'approximation et celle d'optimisation: une nouvelle th\u00e9orie d'approximation polynomiale et r\u00e9sultats pr\u00e9liminaires","volume":"317","author":"Demange","year":"1993","journal-title":"Comptes Rendus de l'Acad\u00e9mie des Sciences de Paris"},{"key":"10.1016\/0304-3975(95)00060-7_BIB9","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(95)00060-7","article-title":"On an approximation measure founded on the links between optimization and polynomial approximation theory","author":"Demange","year":"1993"},{"key":"10.1016\/0304-3975(95)00060-7_BIB10","article-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0304-3975(95)00060-7_BIB11","series-title":"Graphes et Algorithmes","author":"Gondran","year":"1985"},{"issue":"4","key":"10.1016\/0304-3975(95)00060-7_BIB12","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"},{"key":"10.1016\/0304-3975(95)00060-7_BIB13","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF01588971","article-title":"An analysis of approximations for maximizing submodular set functions","volume":"14","author":"Nemhauser","year":"1978","journal-title":"Math. Programming"},{"key":"10.1016\/0304-3975(95)00060-7_BIB14","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1981"},{"key":"10.1016\/0304-3975(95)00060-7_BIB15","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, approximation and complexity classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."},{"issue":"3","key":"10.1016\/0304-3975(95)00060-7_BIB16","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","article-title":"P-complete approximation problems","volume":"23","author":"Sahni","year":"1976","journal-title":"J. ACM"},{"issue":"2","key":"10.1016\/0304-3975(95)00060-7_BIB17","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1137\/0403025","article-title":"On approximate solutions for combinatorial optimization problems","volume":"3","author":"Simon","year":"1990","journal-title":"SIAM J. Discrete Math."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000607?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397595000607?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T21:57:53Z","timestamp":1556315873000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397595000607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,5]]},"references-count":17,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1996,5]]}},"alternative-id":["0304397595000607"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(95)00060-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1996,5]]}}}