{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:33:46Z","timestamp":1750307626363,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,10,31]],"date-time":"2008-10-31T00:00:00Z","timestamp":1225411200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2008,10,31]]},"DOI":"10.1145\/1454630.1454645","type":"proceedings-article","created":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T13:49:50Z","timestamp":1225979390000},"page":"96-103","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Distributed network utility maximization in wireless networks with a bounded number of paths"],"prefix":"10.1145","author":[{"given":"Andr\u00e9","family":"Schumacher","sequence":"first","affiliation":[{"name":"Helsinki University of Technology, Helsinki, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Harri","family":"Haanp\u00e4\u00e4","sequence":"additional","affiliation":[{"name":"Helsinki University of Technology, Helsinki, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,10,31]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132905.1132937"},{"volume-title":"Proc. 43rd IEEE Conf. on Decision and Control. (2004)","author":"Raffard R.","key":"e_1_3_2_1_2_1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2004.831346"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1089444.1089497"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/518913.847804"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.886290"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2007.070602"},{"volume-title":"Proc. 40th Ann. Conf. on Inf. Sci. and Sys. (2006)","author":"Paganini F.","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2006.887322"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.879364"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2600523"},{"volume-title":"Proc. 43rd IEEE Conf. on Decision and Control. (2004)","author":"Lestas I.","key":"e_1_3_2_1_12_1"},{"volume-title":"Proc. 22nd Ann. Joint Conf. IEEE Comp. and Comm. Soc. (INFOCOM). (2003) 2049","year":"2056","author":"Wang J.","key":"e_1_3_2_1_13_1"},{"key":"e_1_3_2_1_14_1","unstructured":"Ahuja R.K. Magnanti T.L. Orlin J.B.: Network Flows: Theory Algorithms and Applications. Prentice Hall Englewood Cliffs NJ (1993)   Ahuja R.K. Magnanti T.L. Orlin J.B.: Network Flows: Theory Algorithms and Applications. Prentice Hall Englewood Cliffs NJ (1993)"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.05.043"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-5316(02)00176-1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Caramia M. Sgalambro A.: An exact approach for the maximum concurrent k-splittable flow problem. Optimization Letters (2007)  Caramia M. Sgalambro A.: An exact approach for the maximum concurrent k-splittable flow problem. Optimization Letters (2007)","DOI":"10.1007\/s11590-007-0055-4"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/647912.740662"},{"key":"e_1_3_2_1_19_1","unstructured":"MOSEK ApS: The MOSEK optimization tools manual. Version 5.0. (2008) Avail. for download at http:\/\/www.mosek.com.  MOSEK ApS: The MOSEK optimization tools manual. Version 5.0. (2008) Avail. for download at http:\/\/www.mosek.com."},{"key":"e_1_3_2_1_20_1","unstructured":"Bertsekas D. Tsitsiklis J.: Parallel and distributed computation: Numerical methods. Prentice Hall (1989)   Bertsekas D. Tsitsiklis J.: Parallel and distributed computation: Numerical methods. Prentice Hall (1989)"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2006.875032"},{"key":"e_1_3_2_1_22_1","unstructured":"Bertsekas D.P.: Nonlinear Programming second edn. Athena Scientific (1999)  Bertsekas D.P.: Nonlinear Programming second edn. Athena Scientific (1999)"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1996.0842"}],"event":{"name":"MSWiM '08: The 11th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems","sponsor":["ACM Association for Computing Machinery","SIGSIM ACM Special Interest Group on Simulation and Modeling"],"location":"Vancouver British Columbia Canada","acronym":"MSWiM '08"},"container-title":["Proceedings of the 3nd ACM workshop on Performance monitoring and measurement of heterogeneous wireless and wired networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1454630.1454645","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1454630.1454645","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:45:54Z","timestamp":1750250754000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1454630.1454645"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,10,31]]},"references-count":23,"alternative-id":["10.1145\/1454630.1454645","10.1145\/1454630"],"URL":"https:\/\/doi.org\/10.1145\/1454630.1454645","relation":{},"subject":[],"published":{"date-parts":[[2008,10,31]]},"assertion":[{"value":"2008-10-31","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}