{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T15:50:24Z","timestamp":1773762624832,"version":"3.50.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2016,6,23]],"date-time":"2016-06-23T00:00:00Z","timestamp":1466640000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Polish Ministry of Science \/ National Institute of Telecommunications","award":["06.30.002.4"],"award-info":[{"award-number":["06.30.002.4"]}]},{"DOI":"10.13039\/501100008530","name":"European Regional Development Fund","doi-asserted-by":"crossref","award":["POIG.02.03.01-104\/13-00"],"award-info":[{"award-number":["POIG.02.03.01-104\/13-00"]}],"id":[{"id":"10.13039\/501100008530","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Polish Ministry of Science \/ National Institute of Telecommunications","award":["06.30.001.6"],"award-info":[{"award-number":["06.30.001.6"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Telecommun Syst"],"published-print":{"date-parts":[[2017,3]]},"DOI":"10.1007\/s11235-016-0190-2","type":"journal-article","created":{"date-parts":[[2016,6,23]],"date-time":"2016-06-23T18:42:39Z","timestamp":1466707359000},"page":"525-542","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A randomized rounding approach to a k-splittable multicommodity flow problem with lower path flow bounds affording solution quality guarantees"],"prefix":"10.1007","volume":"64","author":[{"given":"Pawe\u0142 M.","family":"Bia\u0142o\u0144","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,6,23]]},"reference":[{"key":"190_CR1","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., & Skutella, M. (2005). The $$k$$ k -splittable flow problem. Algorithmica, 42, 231\u2013248.","journal-title":"Algorithmica"},{"key":"190_CR2","unstructured":"B\u0229ben, A., Wi\u015bniewski, P., Krawiec, P., Nowak, M., Pecka, P., Mongay Batalla, J., Bia\u0142o\u0144, P., Olender, P., Gutkowski, J., Belter, B., & \u0141opatowski, \u0141. (2012). Proceedins of the 13th ACIS international conference software engineering, networking and parallel & distributed computing (SNPD), Kyoto, Japan, pp. 643\u2013648, August 2012. Content Aware Network Based on Virtual Infrastructure. SNPD 2012: 643\u2013648. Content Aware Network Based on Virtual Infrastructure. SNPD, 2012, 643\u2013648."},{"key":"190_CR3","doi-asserted-by":"crossref","unstructured":"Bia\u0142o\u0144, P. (September 2015). Metoda rozwia\u0327zywania $$k$$ k -podzielnego zadania przep\u0142ywu wielotowarowego z ograniczeniami dolnymi na przep\u0142yw w \u015bcie\u017cce oparta o randomizowane zaokra\u0327glanie. Conference: Krajowe Sympozjum Telekomunikacji i Teleinformatyki, 16\u201318 September 2015, Krak\u00f3w, Poland. Przegla\u0327d Telekomunikacyjny i Wiadomo\u015bci Telekomunikacyjne. SIGMA NOT, Warsaw, 8-9 (2015), 1030-1039 (in Polish).","DOI":"10.15199\/59.2015.8-9.48"},{"key":"190_CR4","doi-asserted-by":"crossref","unstructured":"Burakowski, W., Tarasiuk, H., B\u0229ben, A., & Danilewicz, G. (2012). Virtualized network infrastructure supporting co-existence of parallel internets. In Proceedings of the 13th ACIS International conference software engineering, networking and parallel & distributed computing (SNPD), Kyoto, Japan, August 2012, pp. 679\u2013684.","DOI":"10.1109\/SNPD.2012.67"},{"key":"190_CR5","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1007\/s11590-009-0147-4","volume":"4","author":"M Caramia","year":"2010","unstructured":"Caramia, M., & Sgalambro, A. (2010). A fast heuristic algorithm for the maximum concurrent k-splittable flow problem. Optimization Letters, 4, 37\u201355.","journal-title":"Optimization Letters"},{"key":"190_CR6","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2001","unstructured":"Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2001). Introduction to Algorithms. McGraw-Hill: MIT Press."},{"key":"190_CR7","doi-asserted-by":"crossref","unstructured":"Fratta, L., Grela, M., & Kleinrock, L. (1973). The flow deviation method: An approach to store and forward computer communication network design. Networks, 3, 97\u2013133.","DOI":"10.1002\/net.3230030202"},{"key":"190_CR8","unstructured":"Gamst, M. (2013). A decomposition based on path sets for the multi-commodity k-splittable maximum flow problem. Department of Management Engineering: Technical University of Denmark, DTU Management Engineering Report No. 6."},{"key":"190_CR9","volume-title":"Algorithms and combinatorics","author":"AV Goldberg","year":"1990","unstructured":"Goldberg, A. V., Tardos, \u00c9., & Tarjan, R. E. (1990). Network flow algorithms. In B. Korte (Ed.), Algorithms and combinatorics (Vol. 9). Berlin: Springer."},{"key":"190_CR10","unstructured":"Ghein, L. D. (2006). MPLS fundamentals. Cisco Press."},{"key":"190_CR11","unstructured":"Granat, J., Sienkiewicz, K., & Szymak, W. (2015). Sieci sterowane programowo w Systemie IIP. Conference: Krajowe Sympozjum Telekomunikacji i Teleinformatyki, 16\u201318 September 2015, Krak\u00f3w, Poland. Przegla\u0327d Telekomunikacyjny i Wiadomo\u015bci telekomunikacyjne. SIGMA NOT, Warsaw, 8\u20139 (2015), pp. 1020\u20131029 (in Polish)."},{"issue":"2","key":"190_CR12","first-page":"1","volume":"8","author":"Ch Jiao","year":"2015","unstructured":"Jiao, Ch., Gao, S., & Yang, W. (2015). Comparing algorithms for minimizing congestion and cost in the multi-commodity k-splittable flow. Computer and Information Science, 8(2), 1\u20138.","journal-title":"Computer and Information Science"},{"key":"190_CR13","doi-asserted-by":"crossref","unstructured":"Jiao, C., & Xia, Y (2014). The k-splittable flow model and heuristic algorithm for minimizing congestion in the MPLS networks. In International conference on natural computation, ICNC 2014, Xiamen, China, August 19\u201321. IEEE, 2014.","DOI":"10.1109\/ICNC.2014.6975985"},{"key":"190_CR14","unstructured":"Kleinberg, J. M. (1996). Approximation algorithms for disjoint path problems. PhD. thesis, Massachusetts Institute of Technology, USA."},{"key":"190_CR15","unstructured":"Kearns, M., & Saul, L. (2010). Large deviation methods for approximate probabilistic inference. In Proceedings of the fourteenth conference on uncertainty in artificial intelligence (UAI1998), Madison, Wisconsin, USA, Morgam Kaufmanni, San Mateo, California, USA."},{"key":"190_CR16","doi-asserted-by":"crossref","unstructured":"Koch, R., Skutella, M., & Spenke, I. (2008). Maximum k-splittable s-t flows. Theory of Computing Systems, 43(1), 56\u201366.","DOI":"10.1007\/s00224-007-9068-8"},{"key":"190_CR17","unstructured":"Makhorin, A. (2013). GNU linear programming kit. Reference manual for GLPK Version\u00a04.52, Draft\u00a02013, Free Software Foundation Inc., Boston, USA."},{"key":"190_CR18","doi-asserted-by":"crossref","unstructured":"McKeown, N., et al. (2008). OpenFlow: Enabling innovation in campus networks, ACM SIGCOMM Computer Communication Review, 38(2), 1 April 2008.","DOI":"10.1145\/1355734.1355746"},{"issue":"2","key":"190_CR19","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1002\/net.20121","volume":"48","author":"M Martens","year":"2006","unstructured":"Martens, M., & Skutella, M. (2006). Flows on a few paths: Algorithms and lower bounds. Networks, 48(2), 68\u201376.","journal-title":"Networks"},{"key":"190_CR20","unstructured":"Medina, A., Laghina, A., Matta, I., & Byers, J. (2001). BRITE: Universal topology generation from a user\u2019s perspective, Boston University, Boston, User Manual, http:\/\/www.cs.bu.edu\/brite\/publications\/usermanual ."},{"issue":"4","key":"190_CR21","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P Raghavan","year":"1987","unstructured":"Raghavan, P., & Thompson, C. (1987). Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4), 365\u2013374.","journal-title":"Combinatorica"},{"key":"190_CR22","unstructured":"Software-Defined Networking: The New Norm for Networks (2012). Open Networking Foundation White Paper, April 13, 2012."},{"key":"190_CR23","unstructured":"Synergistic Challenges in Data-Intensive Science and Exascale Computing. (2014). Summary report of the advanced scientific computing advisory committee (ASCAC). The U.S. Department of Energy, Department of Science, March 2014, http:\/\/science.energy.gov ."},{"key":"190_CR24","doi-asserted-by":"crossref","unstructured":"Truffot, J., & Duhamel, C. (2008). A branch and price algorithm for the k-splittable maximum flow problem. Discrete Optimization, 5, 629\u2013646.","DOI":"10.1016\/j.disopt.2008.01.002"},{"key":"190_CR25","doi-asserted-by":"crossref","unstructured":"Wierzbicki, A. P., Makowski, M., & Wessels, J. (Eds). (2000). Model-based decision support methodology with environmental applications. Kluwer, Dodrecht.","DOI":"10.1007\/978-94-015-9552-0"}],"container-title":["Telecommunication Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11235-016-0190-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-016-0190-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-016-0190-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11235-016-0190-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,9]],"date-time":"2019-09-09T23:52:26Z","timestamp":1568073146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11235-016-0190-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,23]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2017,3]]}},"alternative-id":["190"],"URL":"https:\/\/doi.org\/10.1007\/s11235-016-0190-2","relation":{},"ISSN":["1018-4864","1572-9451"],"issn-type":[{"value":"1018-4864","type":"print"},{"value":"1572-9451","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,6,23]]}}}