{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:32:47Z","timestamp":1771036367500,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642321467","type":"print"},{"value":"9783642321474","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-32147-4_1","type":"book-chapter","created":{"date-parts":[[2012,7,5]],"date-time":"2012-07-05T11:54:50Z","timestamp":1341489290000},"page":"1-14","source":"Crossref","is-referenced-by-count":6,"title":["Structure Theorems for Optimum Hyperpaths in Directed Hypergraphs"],"prefix":"10.1007","author":[{"given":"Giorgio","family":"Ausiello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Giuseppe F.","family":"Italiano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luigi","family":"Laura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Umberto","family":"Nanni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fabiano","family":"Sarracco","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"418","DOI":"10.1137\/0215029","volume":"15","author":"G. Ausiello","year":"1986","unstructured":"Ausiello, G., D\u2019Atri, A., Sacc\u00e0, D.: Minimal representation of directed hypergraphs. SIAM Journal on Computing\u00a015, 418\u2013431 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"1_CR2","unstructured":"Ausiello, G., Italiano, G.F., Laura, L., Nanni, U., Sarracco, F.: Classification and traversal algorithmic techniques for optimization problems on directed hyperpaths. Technical Report TR-18-10, Department of Computer and System Sciences, Universit\u00e0 di Roma La Sapienza, Roma, Italy (2010)"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/BF01386390","volume":"1","author":"E.W. Dijkstra","year":"1959","unstructured":"Dijkstra, E.W.: A note on two problems in connection with graphs. Numerische Mathematik\u00a01, 269\u2013271 (1959)","journal-title":"Numerische Mathematik"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0166-218X(93)90045-P","volume":"42","author":"G. Gallo","year":"1993","unstructured":"Gallo, G., Longo, G., Nguyen, S., Pallottino, S.: Directed hypergraphs and applications. Discrete Applied Mathematics\u00a042, 177\u2013201 (1993)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0020-0190(77)90002-3","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E.: A generalization of Dijkstra\u2019s Algorithm. Information Processing Letters\u00a06(1), 1\u20135 (1977)","journal-title":"Information Processing Letters"},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1006\/jagm.1996.0046","volume":"21","author":"G. Ramalingam","year":"1996","unstructured":"Ramalingam, G., Reps, T.: An incremental algorithm for a generalization of the shortest path problem. Journal of Algorithms\u00a021(2), 267\u2013305 (1996)","journal-title":"Journal of Algorithms"},{"issue":"27-29","key":"1_CR7","doi-asserted-by":"publisher","first-page":"2592","DOI":"10.1016\/j.tcs.2009.02.038","volume":"410","author":"M. Thakur","year":"2009","unstructured":"Thakur, M., Tripathi, R.: Linear connectivity problems in directed hypergraphs. Theoretical Computer Science\u00a0410(27-29), 2592\u20132618 (2009)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-32147-4_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:55:57Z","timestamp":1620129357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-32147-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642321467","9783642321474"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-32147-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}