{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:32:58Z","timestamp":1759847578081},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2007,6,28]],"date-time":"2007-06-28T00:00:00Z","timestamp":1182988800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optimization Letters"],"published-print":{"date-parts":[[2008,3]]},"DOI":"10.1007\/s11590-007-0055-4","type":"journal-article","created":{"date-parts":[[2007,6,27]],"date-time":"2007-06-27T08:41:53Z","timestamp":1182933713000},"page":"251-265","source":"Crossref","is-referenced-by-count":11,"title":["An exact approach for the maximum concurrent k-splittable flow problem"],"prefix":"10.1007","volume":"2","author":[{"given":"Massimiliano","family":"Caramia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antonino","family":"Sgalambro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,6,28]]},"reference":[{"key":"55_CR1","doi-asserted-by":"crossref","unstructured":"Andrews, M., Zhang, L.: Hardness of the undirected congestion minimization problem. In: Proceedings of the 37th Annual ACM Symposium on Theory of Computing (2005)","DOI":"10.1145\/1060590.1060633"},{"key":"55_CR2","doi-asserted-by":"crossref","unstructured":"Azar, Y., Regev, O.: Strongly polynomial algorithms for the unsplittable flow problem. In: Proceedings of the 8th Conference on Integer Programming and Combinatorial Optimization, pp. 15\u201329 (2001)","DOI":"10.1007\/3-540-45535-3_2"},{"key":"55_CR3","unstructured":"Badics, T.: GENRMF, ftp:\/\/dimacs.rutgers.edu\/pub\/netflow\/generators\/network\/genrmf\/"},{"key":"55_CR4","unstructured":"Baier, G.: Flows with path restrictions. Ph.D. Thesis, Technisce Universitat Berlin, Cuvillier Verlag Gottingen (2003)"},{"key":"55_CR5","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/s00453-005-1167-9","volume":"42","author":"G. Baier","year":"2005","unstructured":"Baier G., K\u00f6hler E. and Skutella M. (2005). On the k-splittable flow problem. Algorithmica 42: 231\u2013248","journal-title":"Algorithmica"},{"issue":"3","key":"55_CR6","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1007\/s101070100254","volume":"91","author":"D. Bienstock","year":"2002","unstructured":"Bienstock D. and Raskina O. (2002). Asymptotic analysis of the flow deviation method for the maximum concurrent flow problem. Math. Program. Ser. B. 91(3): 479\u2013492","journal-title":"Math. Program. Ser. B."},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"Caramia, M., Sgalambro, A.: On the approximation of the single source k-splittable flow problem. J. Discrete Algorithms (2007, in press). doi:10.1016\/j.jda.2007.03.001","DOI":"10.1016\/j.jda.2007.03.001"},{"key":"55_CR8","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Naor, J.: New hardness results for congestion minimization and machine scheduling. In: Proceedings of the 36th Annual ACM Symposium of Theory of Computing, Chicago, IL, pp. 28\u201334 (2004)","DOI":"10.1145\/1007352.1007364"},{"issue":"1","key":"55_CR9","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s004930050043","volume":"19","author":"Y. Dinitz","year":"1999","unstructured":"Dinitz Y., Garg N. and Goemans M.X. (1999). On the single-source unsplittable flow problem. Combinatorica 19(1): 17\u201341","journal-title":"Combinatorica"},{"key":"55_CR10","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/BF02288321","volume":"13","author":"D. Goldfarb","year":"1988","unstructured":"Goldfarb D. and Grigoriadis M. (1988). A computational comparison of the Dinic and Network Simplex methods for maximum flow. Ann. Oper. Res. 13: 83\u2013123","journal-title":"Ann. Oper. Res."},{"key":"55_CR11","unstructured":"Kleinberg, J.: Approximation Algorithms for Disjoint Paths Problems. Ph.D. Thesis, MIT, Cambridge (1996)"},{"key":"55_CR12","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.: Single-source unsplittable flow. In: Proceedings of the 37th Annual Symposium on Foundations of Computer Science, pp. 68\u201377 (1996)","DOI":"10.1109\/SFCS.1996.548465"},{"key":"55_CR13","doi-asserted-by":"crossref","unstructured":"Koch, R., Skutella, M., Spenke, I.: Approximation and complexity of k-splittable flows. Technical Report (2005)","DOI":"10.1007\/11671411_19"},{"key":"55_CR14","doi-asserted-by":"crossref","unstructured":"Kolliopoulos, S.G.: Improved approximation algorithms for unsplittable flow problems. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 426\u2013435 (1997)","DOI":"10.1109\/SFCS.1997.646131"},{"issue":"1","key":"55_CR15","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ipl.2004.12.009","volume":"9","author":"S.G. Kolliopoulos","year":"2005","unstructured":"Kolliopoulos S.G. (2005). Minimum-cost single-source splittable flow. Inf. Process. Lett. 9(1): 15\u201318","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"55_CR16","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1002\/net.20121","volume":"48","author":"M. Martens","year":"2006","unstructured":"Martens M. and Skutella M. (2006). Flows on few paths: algorithms and lower bounds. Networks 48(2): 68\u201376","journal-title":"Networks"},{"key":"55_CR17","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/3-540-32539-5_47","volume":"2005","author":"M. Martens","year":"2006","unstructured":"Martens M. and Skutella M. (2006). Length-bounded and dynamic k-splittable flows. Oper. Res. Proc. 2005: 297\u2013302","journal-title":"Oper. Res. Proc."},{"issue":"4","key":"55_CR18","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan P. and Thompson C. (1987). Randomized rounding: a technique for provable good algorithms and algorithmic proofs. Combinatorica 7(4): 365\u2013374","journal-title":"Combinatorica"},{"key":"55_CR19","doi-asserted-by":"crossref","first-page":"318","DOI":"10.1145\/77600.77620","volume":"37","author":"D.W. Matula","year":"1990","unstructured":"Matula D.W. and Shahrokhi F. (1990). The maximum concurrent flow problem. J. ACM 37: 318\u2013334","journal-title":"J. ACM"},{"key":"55_CR20","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1007\/s101070100260","volume":"91","author":"M. Skutella","year":"2002","unstructured":"Skutella M. (2002). Approximating the single source unsplittable min-cost flow problem. Math. Program. 91: 493\u2013514","journal-title":"Math. Program."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-007-0055-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-007-0055-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-007-0055-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T15:15:02Z","timestamp":1559574902000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-007-0055-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,28]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,3]]}},"alternative-id":["55"],"URL":"https:\/\/doi.org\/10.1007\/s11590-007-0055-4","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,28]]}}}