{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T08:12:18Z","timestamp":1773389538234,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540228493","type":"print"},{"value":"9783540278368","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_21","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T22:53:21Z","timestamp":1284591201000},"page":"222-233","source":"Crossref","is-referenced-by-count":37,"title":["Approximating Longest Directed Paths and Cycles"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Bj\u00f6rklund","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thore","family":"Husfeldt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sanjeev","family":"Khanna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"21_CR1","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N. Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. Journal of the ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"Journal of the ACM"},{"issue":"6","key":"21_CR2","doi-asserted-by":"publisher","first-page":"1395","DOI":"10.1137\/S0097539702416761","volume":"32","author":"A. Bj\u00f6rklund","year":"2003","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Finding a path of superlogarithmic length. SIAM Journal on Computing\u00a032(6), 1395\u20131402 (2003)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814068","volume-title":"Random graphs","author":"B. Bollob\u00e1s","year":"2001","unstructured":"Bollob\u00e1s, B.: Random graphs, 2nd edn. Cambridge University Press, Cambridge (2001)","edition":"2"},{"issue":"5","key":"21_CR4","doi-asserted-by":"publisher","first-page":"1596","DOI":"10.1137\/S0097539701395486","volume":"31","author":"T. Feder","year":"2002","unstructured":"Feder, T., Motwani, R., Subi, C.: Approximating the longest cycle problem in sparse graphs. SIAM Journal on Computing\u00a031(5), 1596\u20131607 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"21_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/0304-3975(80)90009-2","volume":"10","author":"S. Fortune","year":"1980","unstructured":"Fortune, S., Hopcroft, J., Wyllie, J.: The directed subgraph homeomorphism problem. Theoretical Computer Science\u00a010, 111\u2013121 (1980)","journal-title":"Theoretical Computer Science"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Gabow, H.N.: Finding paths and cycles of superlogarithmic length. In: Proc. 36th STOC (2004)","DOI":"10.1145\/1007352.1007418"},{"key":"21_CR7","unstructured":"Gabow, H.N., Nie, S.: Finding a long directed cycle. In: Proc. 15th SODA (2004)"},{"issue":"2","key":"21_CR8","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R. Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of k-SAT. Journal of Computer and Systems Sciences\u00a062(2), 367\u2013375 (2001)","journal-title":"Journal of Computer and Systems Sciences"},{"key":"21_CR9","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? In: Proc. 39th FOCS, pp. 653\u2013663 (1998)","DOI":"10.1109\/SFCS.1998.743516"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/BF02523689","volume":"18","author":"D. Karger","year":"1997","unstructured":"Karger, D., Motwani, R., Ramkumar, G.D.S.: On approximating the longest path in a graph. Algorithmica\u00a018(1), 82\u201398 (1997)","journal-title":"Algorithmica"},{"key":"21_CR11","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1994","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison-Wesley, Reading (1994)"},{"key":"21_CR12","doi-asserted-by":"crossref","unstructured":"Robertson, N., Seymour, P.D.: Graph minors XIII: The disjoints paths problem. J. Combinatorial Theory Ser. B\u00a035 (1983)","DOI":"10.1016\/0095-8956(83)90079-5"},{"key":"21_CR13","doi-asserted-by":"crossref","unstructured":"Schaefer, T.J.: The complexity of satisfiability problems. In: Proc. 10th STOC, pp. 216\u2013226 (1978)","DOI":"10.1145\/800133.804350"},{"key":"21_CR14","unstructured":"Vishwanathan, S.: An approximation algorithm for finding a long path in Hamiltonian graphs. In: Proc. 11th SODA, pp. 680\u2013685 (2000)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T04:23:51Z","timestamp":1605759831000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}