{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,5]],"date-time":"2025-05-05T04:01:58Z","timestamp":1746417718832,"version":"3.40.4"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319084213"},{"type":"electronic","value":"9783319084220"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-08422-0_60","type":"book-chapter","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T15:17:11Z","timestamp":1407856631000},"page":"411-416","source":"Crossref","is-referenced-by-count":0,"title":["Approximation algorithms for utility-maximizing network design problem"],"prefix":"10.1007","author":[{"given":"Maciej","family":"Drwal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"60_CR1","doi-asserted-by":"crossref","unstructured":"B. Awerbuch and Y. Azar. Buy-at-bulk network design. In: 38th Annual Symposium on Foundations of Computer Science, 1997, pages 542\u2013547. IEEE, 1997.","DOI":"10.1109\/SFCS.1997.646143"},{"issue":"1","key":"60_CR2","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1109\/JPROC.2006.887322","volume":"95","author":"M Chiang","year":"2007","unstructured":"M. Chiang, et al. Layering as optimization decomposition: A mathematical theory of network architectures. Proc. of the IEEE, 95(1):255\u2013312, 2007.","journal-title":"Proc. of the IEEE"},{"key":"60_CR3","unstructured":"M. Drwal and D. Gasior. Utility-based rate control and capacity allocation in virtual networks. In Proc. of the 1st European Teletraffic Seminar, 2011."},{"key":"60_CR4","doi-asserted-by":"crossref","unstructured":"M. Drwal and J. Jozefczyk. Decomposition algorithms for data placement problem based on Lagrangian relaxation and randomized rounding. Annals of Operations Research, DOI: 10.1007\/s10479-013-1330-7, 2013.","DOI":"10.1007\/s10479-013-1330-7"},{"key":"60_CR5","unstructured":"M. Garey and D. Johnson. Computers and intractability, Freeman New York, 1979."},{"issue":"14","key":"60_CR6","doi-asserted-by":"publisher","first-page":"2675","DOI":"10.1016\/j.comnet.2013.06.012","volume":"57","author":"D Gasior","year":"2013","unstructured":"D. Gasior and M. Drwal. Pareto-optimal Nash equilibrium in capacity allocation game for self-managed networks. Computer Networks, 57(14):2675\u20132868, 2013.","journal-title":"Computer Networks"},{"issue":"4","key":"60_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/net.3230080402","volume":"8","author":"D Johnson","year":"1978","unstructured":"D. Johnson, J.K. Lenstra, and A. Kan. The complexity of the network design problem. Networks, 8(4):279\u2013285, 1978.","journal-title":"Networks"},{"issue":"2-3","key":"60_CR8","doi-asserted-by":"publisher","first-page":"159","DOI":"10.3166\/ejc.9.159-176","volume":"9","author":"F Kelly","year":"2003","unstructured":"F. Kelly. Fairness and stability of end-to-end congestion control. European Journal of Control, 9(2-3):159\u2013176, 2003.","journal-title":"European Journal of Control"},{"issue":"3","key":"60_CR9","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1057\/palgrave.jors.2600523","volume":"49","author":"F Kelly","year":"1998","unstructured":"F. Kelly, A. Maulloo, and D. Tan. Rate control for communication networks: shadow prices, proportional fairness and stability. Journal of the Operational Research society, 49(3):237\u2013252, 1998.","journal-title":"Journal of the Operational Research society"},{"key":"60_CR10","doi-asserted-by":"crossref","unstructured":"T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46(6), 1999.","DOI":"10.1145\/331524.331526"},{"issue":"4","key":"60_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P Raghavan","year":"1987","unstructured":"P. Raghavan and C. Tompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica, 7(4):365\u2013374, 1987.","journal-title":"Combinatorica"},{"issue":"3","key":"60_CR12","doi-asserted-by":"publisher","first-page":"582","DOI":"10.1109\/TNET.2005.850219","volume":"13","author":"J Wang","year":"2005","unstructured":"J. Wang, L. Li, S. Low, and J. Doyle. Cross-layer optimization in TCP\/IP networks. IEEE\/ACM Transactions on Networking, 13(3):582\u2013595, 2005.","journal-title":"IEEE\/ACM Transactions on Networking"}],"container-title":["Advances in Intelligent Systems and Computing","Progress in Systems Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08422-0_60","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,4]],"date-time":"2025-05-04T04:38:07Z","timestamp":1746333487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-08422-0_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319084213","9783319084220"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08422-0_60","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2015]]}}}