{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:31:53Z","timestamp":1725456713251},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540508403"},{"type":"electronic","value":"9783540460985"}],"license":[{"start":{"date-parts":[[1989,1,1]],"date-time":"1989-01-01T00:00:00Z","timestamp":599616000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/bfb0028990","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:28:19Z","timestamp":1133396899000},"page":"256-268","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["On the complexity of approximating the independent set problem"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Georg","family":"Schnitger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,16]]},"reference":[{"key":"22_CR1","unstructured":"AUSIELLO, G., D'ATRI, A., AND PROTASSI,M. (1977). On the Structure of Combinatorial Problems and Structure Preserving Reductions, Proc. 4th Intl. Coll. on Automata, Languages and Programming, 45\u201357."},{"key":"22_CR2","doi-asserted-by":"crossref","first-page":"136","DOI":"10.1016\/0022-0000(80)90046-X","volume":"21","author":"G. Ausiello","year":"1980","unstructured":"AUSIELLO, G., D'ATRI, A., and PROTASSI, M. (1980). Structure Preserving Reductions among Convex Optimization Problems, J. Comp. Sys. Sc. 21, 136\u2013153.","journal-title":"J. Comp. Sys. Sc."},{"key":"22_CR3","first-page":"83","volume":"12","author":"G. Ausiello","year":"1980","unstructured":"AUSIELLO, G., MARCHETTI-SPACCAMELA, A., and PROTASSI, M. (1980). Towards a Unified Approach for the Classification of NP-Complete Optimization Problems\", 12, 83\u201396.","journal-title":"Towards a Unified Approach for the Classification of NP-Complete Optimization Problems"},{"key":"22_CR4","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"CHERNOFF, H. (1952). A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the Sum of Observations, Ann. of Math. Stat. 23, 493\u2013507.","journal-title":"Ann. of Math. Stat."},{"key":"22_CR5","unstructured":"ERDOES, P., AND SPENCER, J. (1974). Probabilistic Methods in Combinatorics, Academic Press."},{"key":"22_CR6","unstructured":"FELLER, W., An Introduction to Probability Theory and its Applications, John Wiley & Sons, Vol. 1, 3rd edition."},{"key":"22_CR7","unstructured":"GONZALEZ, T.F., AND KURKI-GOWDARA, S. (1987). An Approximation Algorithm for the Via Placement and Related Problems. Technical Report, University of California at Santa Barbara."},{"key":"22_CR8","unstructured":"GAREY, M.R., AND JOHNSON, D.S.(1979). Computers and Intractability: A Guide to the Theory of NP-completeness, W.H. Freeman."},{"key":"22_CR9","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"JOHNSON, D.S. (1974). Approximation Algorithms for Combinatorial Problems, J. Comp. Sys. Sci. 9, 256\u2013278.","journal-title":"J. Comp. Sys. Sci."},{"key":"22_CR10","unstructured":"KRENTEL, M.W. (1986). The Complexity of Optimization problems, Proc. 18th Annual ACM Symp. on Theory of Computing, 69\u201376."},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"LEIGHTON, T., AND RAO, S. (1988). An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximate Algorithms. Proc. 29th Annual Symp. on Foundations of Computer Science, 422\u2013431.","DOI":"10.1109\/SFCS.1988.21958"},{"key":"22_CR12","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/322063.322075","volume":"25","author":"D. Maier","year":"1978","unstructured":"MAIER, D. (1978). The Complexity of Some Problems on Subsequences and Supersequences, J. Assoc. Comput. Mach. 25, 322\u2013336.","journal-title":"J. Assoc. Comput. Mach."},{"key":"22_CR13","doi-asserted-by":"crossref","unstructured":"MEHLHORN, K. (1984). Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness, Springer Verlag, 183\u2013184.","DOI":"10.1007\/978-3-642-69897-2"},{"key":"22_CR14","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0304-3975(81)90081-5","volume":"15","author":"A. Paz","year":"1981","unstructured":"PAZ, A., and MORAN, S., (1981). Non Deterministic Polynomial Optimization Problems and their Approximation, Theor. Comput. Sci. 15, 251\u2013277.","journal-title":"Theor. Comput. Sci."},{"key":"22_CR15","unstructured":"PAPADIMITRIOU, C.H., AND YANNAKAKIS, M. (1988). Optimization, Approximation and Complexity Classes, Proc. 20th Annual ACM Symp. on Theory of Computing, 229\u2013234."},{"key":"22_CR16","unstructured":"WIGDERSON, A. (1982). A New Approximate Graph Coloring Algorithm, Proc. 14th Annual ACM Symp. on Theory of Computing, 325\u2013329."}],"container-title":["Lecture Notes in Computer Science","STACS 89"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0028990","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T23:31:05Z","timestamp":1578526265000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0028990"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540508403","9783540460985"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0028990","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]},"assertion":[{"value":"16 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}