{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:25:27Z","timestamp":1725549927267},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540291183"},{"type":"electronic","value":"9783540319511"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11561071_24","type":"book-chapter","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T12:46:24Z","timestamp":1128602784000},"page":"249-258","source":"Crossref","is-referenced-by-count":0,"title":["An Algorithm for Node-Capacitated Ring Routing"],"prefix":"10.1007","author":[{"given":"Andr\u00e1s","family":"Frank","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zolt\u00e1n","family":"Kir\u00e1ly","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bal\u00e1zs","family":"Kotnyek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"24_CR1","volume-title":"Flows in Networks","author":"L.R. Ford","year":"1962","unstructured":"Ford, L.R., Fulkerson, D.R.: Flows in Networks. Princeton Univ. Press, Princeton (1962)"},{"key":"24_CR2","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1016\/0095-8956(85)90046-2","volume":"2","author":"A. Frank","year":"1985","unstructured":"Frank, A.: Edge-disjoint paths in planar graphs. J. of Combinatorial Theory, Ser. B\u00a02, 164\u2013178 (1985)","journal-title":"J. of Combinatorial Theory, Ser. B"},{"issue":"2","key":"24_CR3","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1287\/moor.27.2.372.323","volume":"27","author":"A. Frank","year":"2002","unstructured":"Frank, A., Shepherd, B., Tandon, V., V\u00e9gh, Z.: Node-capacitated ring routing. Mathematics of Operations Research\u00a027(2), 372\u2013383 (2002)","journal-title":"Mathematics of Operations Research"},{"key":"24_CR4","unstructured":"Kir\u00e1ly, Z.: An O(n2) algorithm for ring routing, Egres Technical Reports, TR-2005-10 (2005), see \n                  \n                    http:\/\/www.cs.elte.hu\/egres\/"},{"key":"24_CR5","first-page":"429","volume-title":"Annotated Bibliographies in Combinatorial Optimization","author":"R.H. M\u00f6hring","year":"1997","unstructured":"M\u00f6hring, R.H., Wagner, D.: Combinatorial Topics in VLSI Design. In: Dell\u2019 Amico, M., Maffioli, F.M., Martello, S. (eds.) Annotated Bibliographies in Combinatorial Optimization, pp. 429\u2013444. John Wiley, Chichester (1997)"},{"key":"24_CR6","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1109\/TCT.1971.1083312","volume":"18","author":"K. Onaga","year":"1971","unstructured":"Onaga, K., Kakusho, O.: On feasibility conditions of multicommodity flows in Networks. IEEE Trans. Theory\u00a018, 425\u2013429 (1971)","journal-title":"IEEE Trans. Theory"},{"key":"24_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0095-8956(81)80012-3","volume":"31","author":"H. Okamura","year":"1981","unstructured":"Okamura, H., Seymour, P.D.: Multicommodity flows in planar graphs. J. Combinatorial Theory, Ser. B\u00a031, 75\u201381 (1981)","journal-title":"J. Combinatorial Theory, Ser. B"},{"key":"24_CR8","series-title":"DIMACS-Series in Discrete Mathematics and Theoretical Computer Science","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1090\/dimacs\/020\/06","volume-title":"Year of Combinatorial Optimization","author":"H. Ripphausen-Lipa","year":"1995","unstructured":"Ripphausen-Lipa, H., Wagner, D., Weihe, K.: Survey on Efficient Algorithms for Disjoint Paths Problems in Planar Graphs. In: Cook, W., Lov\u00e1sz, L., Seymour, P.D. (eds.) Year of Combinatorial Optimization. DIMACS-Series in Discrete Mathematics and Theoretical Computer Science, vol.\u00a020, pp. 295\u2013354. AMS, Providence (1995)"},{"issue":"1","key":"24_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1137\/S0895480195294994","volume":"11","author":"A. Schrijver","year":"1998","unstructured":"Schrijver, A., Seymour, P., Winkler, P.: The ring loading problem. SIAM J. Discrete Math.\u00a011(1), 1\u201314 (1998)","journal-title":"SIAM J. Discrete Math."},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/BF01294465","volume":"15","author":"D. Wagner","year":"1995","unstructured":"Wagner, D., Weihe, K.: A linear-time algorithm for edge-disjoint paths in planar graphs. Combinatorica\u00a015, 135\u2013150 (1995)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2005"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11561071_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:13:26Z","timestamp":1619507606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11561071_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540291183","9783540319511"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11561071_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}