{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:10:46Z","timestamp":1725516646544},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540850960"},{"type":"electronic","value":"9783540850977"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-85097-7_17","type":"book-chapter","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T07:18:26Z","timestamp":1219130306000},"page":"180-189","source":"Crossref","is-referenced-by-count":0,"title":["Flows with Unit Path Capacities and Related Packing and Covering Problems"],"prefix":"10.1007","author":[{"given":"Maren","family":"Martens","sequence":"first","affiliation":[]},{"given":"Martin","family":"Skutella","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1287\/moor.25.2.255.12228","volume":"25","author":"A. Baveja","year":"2000","unstructured":"Baveja, A., Srinivasan, A.: Approximation algorithms for disjoint paths and related routing and packing problems. Mathematics of Operations Research\u00a025, 255\u2013280 (2000)","journal-title":"Mathematics of Operations Research"},{"key":"17_CR2","doi-asserted-by":"crossref","first-page":"399","DOI":"10.4153\/CJM-1956-045-5","volume":"8","author":"L.R. Ford","year":"1956","unstructured":"Ford, L.R., Fulkerson, D.R.: Maximal flow through a network. Canadian J. of Math.\u00a08, 399\u2013404 (1956)","journal-title":"Canadian J. of Math."},{"key":"17_CR3","doi-asserted-by":"crossref","unstructured":"Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. In: Proc. 31st Annual ACM Symposium on Theory of Computing, pp. 19\u201328 (1999)","DOI":"10.1145\/301250.301262"},{"key":"17_CR4","unstructured":"Kleinberg, J.M.: Approximation Algorithms for Disjoint Path Problems. PhD thesis. MIT (May 1996)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Kolliopoulos, S.G.: Edge-disjoint paths and unsplittable flow. In: Gonzalez, T.F. (ed.) Handbook of Approximation Algorithms and Metaheuristics, ch.\u00a057. Chapman-Hall\/CRC Press (2007)","DOI":"10.1201\/9781420010749.ch57"},{"key":"17_CR6","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1287\/mnsc.18.7.401","volume":"18","author":"E.L. Lawler","year":"1972","unstructured":"Lawler, E.L.: A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem. Management Science\u00a018, 401\u2013405 (1972)","journal-title":"Management Science"},{"issue":"2","key":"17_CR7","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1002\/net.20121","volume":"48","author":"M. Martens","year":"2006","unstructured":"Martens, M., Skutella, M.: Flows on few paths: Algorithms and lower bounds. Networks\u00a048(2), 68\u201376 (2006)","journal-title":"Networks"},{"key":"17_CR8","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1287\/moor.20.2.257","volume":"20","author":"S.A. Plotkin","year":"1995","unstructured":"Plotkin, S.A., Shmoys, D.B., Tardos, E.: Fast approximation algorithms for fractional packing and covering problems. Mathematics of Operations Research\u00a020, 257\u2013301 (1995)","journal-title":"Mathematics of Operations Research"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.D.: Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica\u00a07, 365\u2013374 (1987)","journal-title":"Combinatorica"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM J. on Computing\u00a08(3), 410\u2013421 (1979)","journal-title":"SIAM J. on Computing"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-85097-7_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:40:59Z","timestamp":1619523659000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-85097-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540850960","9783540850977"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-85097-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}