{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:21:47Z","timestamp":1725740507772},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_34","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T05:36:30Z","timestamp":1373520990000},"page":"390-401","source":"Crossref","is-referenced-by-count":2,"title":["Finding the Minimum-Weight k-Path"],"prefix":"10.1007","author":[{"given":"Avinatan","family":"Hassidim","sequence":"first","affiliation":[]},{"given":"Orgad","family":"Keller","sequence":"additional","affiliation":[]},{"given":"Moshe","family":"Lewenstein","sequence":"additional","affiliation":[]},{"given":"Liam","family":"Roditty","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","first-page":"12","volume":"20","author":"H. Abasi","year":"2013","unstructured":"Abasi, H., Bshouty, N.H.: A simple algorithm for undirected hamiltonicity. Electronic Colloquium on Computational Complexity (ECCC)\u00a020, 12 (2013)","journal-title":"Electronic Colloquium on Computational Complexity (ECCC)"},{"issue":"4","key":"34_CR2","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. J. ACM\u00a042(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"key":"34_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A.: Determinant sums for undirected hamiltonicity. In: FOCS, pp. 173\u2013182. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.24"},{"key":"34_CR4","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Narrow sieves for parameterized paths and packings. CoRR, abs\/1007.1161 (2010)"},{"key":"34_CR5","unstructured":"Chen, J., Lu, S., Sze, S.-H., Zhang, F.: Improved algorithms for path, matching, and packing problems. In: Bansal, N., Pruhs, K., Stein, C. (eds.) SODA, pp. 298\u2013307. SIAM (2007)"},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"Cygan, M., Gabow, H.N., Sankowski, P.: Algorithmic applications of baur-strassen\u2019s theorem: Shortest cycles, diameter and matchings. In: FOCS, pp. 531\u2013540. IEEE Computer Society (2012)","DOI":"10.1109\/FOCS.2012.72"},{"issue":"5","key":"34_CR7","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/S0020-0190(02)00205-3","volume":"83","author":"F. Erg\u00fcn","year":"2002","unstructured":"Erg\u00fcn, F., Sinha, R.K., Zhang, L.: An improved fptas for restricted shortest path. Inf. Process. Lett.\u00a083(5), 287\u2013291 (2002)","journal-title":"Inf. Process. Lett."},{"key":"34_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/11917496_6","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Kneis","year":"2006","unstructured":"Kneis, J., M\u00f6lle, D., Richter, S., Rossmanith, P.: Divide-and-color. In: Fomin, F.V. (ed.) WG 2006. LNCS, vol.\u00a04271, pp. 58\u201367. Springer, Heidelberg (2006)"},{"key":"34_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-540-70575-8_47","volume-title":"Automata, Languages and Programming","author":"I. Koutis","year":"2008","unstructured":"Koutis, I.: Faster algebraic algorithms for path and packing problems. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 575\u2013586. Springer, Heidelberg (2008)"},{"key":"34_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-642-02927-1_54","volume-title":"Automata, Languages and Programming","author":"I. Koutis","year":"2009","unstructured":"Koutis, I., Williams, R.: Limits and applications of group algebras for parameterized problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009, Part I. LNCS, vol.\u00a05555, pp. 653\u2013664. Springer, Heidelberg (2009)"},{"key":"34_CR11","first-page":"239","volume":"25","author":"B. Monien","year":"1985","unstructured":"Monien, B.: How to find long paths efficiently. Annals of Discrete Mathematics\u00a025, 239\u2013254 (1985)","journal-title":"Annals of Discrete Mathematics"},{"issue":"6","key":"34_CR12","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.ipl.2008.11.004","volume":"109","author":"R. Williams","year":"2009","unstructured":"Williams, R.: Finding paths of length k in o*(2k) time. Inf. Process. Lett.\u00a0109(6), 315\u2013318 (2009)","journal-title":"Inf. Process. Lett."},{"key":"34_CR13","doi-asserted-by":"crossref","unstructured":"Williams, V.V.: Multiplying matrices faster than coppersmith-winograd. In: Karloff, H.J., Pitassi, T. (eds.) STOC, pp. 887\u2013898. ACM (2012)","DOI":"10.1145\/2213977.2214056"},{"issue":"3","key":"34_CR14","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1145\/567112.567114","volume":"49","author":"U. Zwick","year":"2002","unstructured":"Zwick, U.: All pairs shortest paths using bridging sets and rectangular matrix multiplication. J. ACM\u00a049(3), 289\u2013317 (2002)","journal-title":"J. ACM"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:31:10Z","timestamp":1557945070000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}