{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:40:02Z","timestamp":1742596802272,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"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":[[1993]]},"DOI":"10.1007\/3-540-57155-8_267","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:06:21Z","timestamp":1330257981000},"page":"421-432","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["On approximating the longest path in a graph"],"prefix":"10.1007","author":[{"given":"David","family":"Karger","sequence":"first","affiliation":[]},{"given":"Rajeev","family":"Motwani","sequence":"additional","affiliation":[]},{"given":"G. D. S.","family":"Ramkumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"39_CR1","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan and M. Szegedy. Proof Verification and Hardness of Approximation Problems. In Proc. 33rd FOCS, pages 14\u201323, 1992.","DOI":"10.1109\/SFCS.1992.267823"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"S. Arora and S. Safra. Approximating Clique is NP-complete. In Proc. 33rd FOCS, pages 2\u201313, 1992.","DOI":"10.1109\/SFCS.1992.267824"},{"key":"39_CR3","unstructured":"M. Bellare. Interactive Proofs and Approximation. IBM Research Report RC 17969, April 1992."},{"key":"39_CR4","unstructured":"B. Bollobas. Random Graphs. Academic Press, 1985."},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"A. Broder, A.M. Frieze and E. Shamir. Finding hidden Hamiltonian cycles. In Proc. 23rd STOC, pages 182\u201389, 1991.","DOI":"10.1145\/103418.103442"},{"key":"39_CR6","doi-asserted-by":"crossref","unstructured":"R. B. Boppana and M. M. Halldorsson. Approximating maximum independent sets by excluding subgraphs. In Proc. 2nd SWAT, pages 13\u201325, 1990.","DOI":"10.1007\/3-540-52846-6_74"},{"key":"39_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0890-5401(92)90056-L","volume":"96","author":"P. Berman","year":"1992","unstructured":"P. Berman and G. Schnitger. On the Complexity of Approximating the Independent Set Problem. Information and Computation, vol. 96, pages 77\u201394, 1992.","journal-title":"Information and Computation"},{"key":"39_CR8","unstructured":"V. Chvatal. Hamiltonian cycles, in The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, (ed: E.L. Lawler et al), pages 402\u2013430, 1985."},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"U. Feige, S. Goldwasser, L. Lov\u00e1sz, S. Safra, and M. Szegedy. Approximating clique is almost NP-complete. In Proc. 32nd FOCS, pages 2\u201312, 1991.","DOI":"10.1109\/SFCS.1991.185341"},{"key":"39_CR10","unstructured":"M. Furer and B. Raghavachari. Approximating the Minimum Degree Spanning Tree to within One from the Optimal Degree. In Proc. 3rd SODA, pages 317\u2013324, 1992."},{"key":"39_CR11","unstructured":"Michael R. Garey and David S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979."},{"key":"39_CR12","first-page":"239","volume":"25","author":"B. Monien","year":"1984","unstructured":"B. Monien. How to find long paths efficiently. Annals of Discrete Mathematics, vol. 25, pages 239\u2013254, 1984.","journal-title":"Annals of Discrete Mathematics"},{"key":"39_CR13","unstructured":"R. Motwani. Lecture Notes on Approximation Algorithms. Report No. STAN-CS-92-1435, Department of Computer Science, Stanford University (1992)."},{"key":"39_CR14","doi-asserted-by":"crossref","unstructured":"C. H. Papadimitriou and M. Yannakakis. Optimization, Approximation, and Complexity Classes. In Proc. 20th STOC, pages 229\u2013234, 1988.","DOI":"10.1145\/62212.62233"},{"key":"39_CR15","unstructured":"C. H. Papadimitriou and M. Yannakakis. The traveling salesman problem with distances one and two, Mathematics of Operations Research, to appear."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_267","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T22:00:02Z","timestamp":1742594402000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_267"}},"subtitle":["Preliminary version"],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_267","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"9 June 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}