{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,6]],"date-time":"2024-08-06T09:57:53Z","timestamp":1722938273796},"reference-count":33,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1999,8,1]],"date-time":"1999-08-01T00:00:00Z","timestamp":933465600000},"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":5099,"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":[[1999,8]]},"DOI":"10.1016\/s0304-3975(97)00226-0","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T23:53:40Z","timestamp":1051142020000},"page":"113-128","source":"Crossref","is-referenced-by-count":46,"title":["Improved non-approximability results for minimum vertex cover with density constraints"],"prefix":"10.1016","volume":"225","author":[{"given":"Andrea E.F.","family":"Clementi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luca","family":"Trevisan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00226-0_BIB1","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1007\/BF01277956","article-title":"Derandomized graph products","volume":"5","author":"Alon","year":"1995","journal-title":"Comput. Complexity"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB2","article-title":"Constructing the highest degree subgraph for dense graphs is in NCAS","author":"Andreev","year":"1995","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00226-0_BIB3","series-title":"Proc. 27th ACM Symp. on Theory of Comput.","first-page":"284","article-title":"Polynomial time approximation schemes for dense instances of NP-hard problems","author":"Arora","year":"1995"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB4","series-title":"Proc. 33rd IEEE Symp. on Foundations of Computer Science","first-page":"14","article-title":"Proof verification and hardness of approximation problems","author":"Arora","year":"1992"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB5","series-title":"Proc. 33rd IEEE Symp. on Foundations of Computer Science","first-page":"2","article-title":"Probabilistic checking of proofs; a new characterization of NP","author":"Arora","year":"1992"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB6","series-title":"Electronic Colloq. on Computational Complexity","article-title":"Free bits, PCP's and non-approximability \u2014 towards tight results (4th version)","author":"Bellare","year":"1996"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB7","series-title":"Proc. 25th ACM Symp. on Theory of Computing","first-page":"294","article-title":"Efficient probabilistically checkable proofs and applications to approximation","author":"Bellare","year":"1993"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB8","series-title":"Proc. 26th ACM Symp. on Theory of Computing","first-page":"184","article-title":"Improved non-approximability results","author":"Bellare","year":"1994"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB9","first-page":"171","article-title":"The Steiner tree problem with edge lengths 1 and 2","volume":"32","author":"Bern","year":"1989"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB10","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0890-5401(91)90025-W","article-title":"Completeness in approximation classes","volume":"93","author":"Crescenzi","year":"1991","journal-title":"Inform. Comput."},{"key":"10.1016\/S0304-3975(97)00226-0_BIB11","series-title":"Proc. 4th IEEE Israel Symp. on Theory of Computing and Systems","first-page":"68","article-title":"To weight or not to weight: where is the question?","author":"Crescenzi","year":"1996"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB12","series-title":"Proc. 14th Conf. on Foundations of Software Technology and Theoretical Computer Science","first-page":"330","article-title":"On approximation scheme preserving reducibility and its applications","volume":"vol. 880","author":"Crescenzi","year":"1994"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB13","series-title":"Proc. 28th ACM Symp. on Theory of Computing","first-page":"314","article-title":"A threshold of ln n for approximating set cover","author":"Feige","year":"1996"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB14","series-title":"Proc. 32nd IEEE Symp. on Foundations of Computer Science","first-page":"2","article-title":"Approximating clique is almost NP-complete","author":"Feige","year":"1991"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB15","series-title":"Proc. 26th ACM Symp. on Theory of Computing","first-page":"172","article-title":"Two prover protocols \u2014 low error at affordable rates","author":"Feige","year":"1994"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB16","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1016\/0022-0000(81)90040-4","article-title":"Explicit construction of linear sized superconcentrators","volume":"22","author":"Gabber","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(97)00226-0_BIB17","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(97)00226-0_BIB18","series-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB19","series-title":"Computers and Intractability: a Guide to the Theory of NP-Completeness","author":"Gavril","year":"1974"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB20","series-title":"Proc. 37th IEEE Symp. on Foundations of Computer Science","first-page":"627","article-title":"Clique is hard to approximate within n1\u2212\u03b5","author":"H\u00e5stad","year":"1996"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB21","series-title":"Proc. 28th ACM Symp. on Theory of Computing","first-page":"11","article-title":"Testing of the long code and hardness for clique","author":"H\u00e5stad","year":"1996"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB22","series-title":"Proc. 29th ACM Symp. on Theory of Computing","first-page":"1","article-title":"Some optimal inapproximability results","author":"H\u00e5stad","year":"1997"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB23","series-title":"Proc. 21st Internat. Colloq. on Automata, Languages and Programming","first-page":"191","article-title":"On the approximation of shortest common supersequences and longest common subsequences","volume":"vol. 820","author":"Jiang","year":"1994"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB24","series-title":"Complexity of Computer Computations","first-page":"85","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB25","series-title":"Proc. 35th IEEE Symp. on Foundations of Computer Science","first-page":"819","article-title":"On syntactic versus computational views of approximability","author":"Khanna","year":"1994"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB26","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/BF02126799","article-title":"Ramanujan graphs","volume":"8","author":"Lubotzky","year":"1988","journal-title":"Combinatorica"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB27","doi-asserted-by":"crossref","first-page":"960","DOI":"10.1145\/185675.306789","article-title":"On the hardness of approximating minimization problems","volume":"41","author":"Lund","year":"1994","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB28","series-title":"Proc. of CAAP83","first-page":"341","article-title":"Some further approximation algorithms for the vertex cover problem","volume":"vol. 159","author":"Monien","year":"1983"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB29","series-title":"Randomized Algorithms","author":"Motwani","year":"1995"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB30","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."},{"key":"10.1016\/S0304-3975(97)00226-0_BIB31","series-title":"Proc. 27th ACM Symp. on Theory of Comput.","first-page":"447","article-title":"A parallel repetition theorem","author":"Raz","year":"1995"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB32","series-title":"Proc. 1st IEEE Conf. on Structure in Complexity Theory, Springer","article-title":"Expanders, randomness or time vs. space","author":"Sipser","year":"1986"},{"key":"10.1016\/S0304-3975(97)00226-0_BIB33","series-title":"Proc. 37th IEEE Symp. on Foundations of Computer Science","first-page":"617","article-title":"Gadgets, approximation, and linear programming","author":"Trevisan","year":"1996"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002260?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597002260?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T07:27:52Z","timestamp":1556522872000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597002260"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,8]]},"references-count":33,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1999,8]]}},"alternative-id":["S0304397597002260"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00226-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1999,8]]}}}