{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T16:48:20Z","timestamp":1743094100271,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642029295"},{"type":"electronic","value":"9783642029301"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02930-1_29","type":"book-chapter","created":{"date-parts":[[2009,7,2]],"date-time":"2009-07-02T11:05:04Z","timestamp":1246532704000},"page":"351-362","source":"Crossref","is-referenced-by-count":0,"title":["Maximum Bipartite Flow in Networks with Adaptive Channel Width"],"prefix":"10.1007","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aleksander","family":"M\u0105dry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"Moscibroda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Debmalya","family":"Panigrahi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aravind","family":"Srinivasan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Andelman, N., Mansour, Y.: Auctions with budget constraints. In: 9th Scandinavian Workshop on Algorithm Theory, pp. 26\u201338 (2004)","DOI":"10.1007\/978-3-540-27810-8_4"},{"issue":"1","key":"29_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/s00453-005-1172-z","volume":"44","author":"Y. Azar","year":"2006","unstructured":"Azar, Y., Regev, O.: Combinatorial algorithms for the unsplittable flow problem. Algorithmica\u00a044(1), 49\u201366 (2006)","journal-title":"Algorithmica"},{"issue":"1","key":"29_CR3","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s00453-006-1210-5","volume":"47","author":"A. Chakrabarti","year":"2007","unstructured":"Chakrabarti, A., Chekuri, C., Gupta, A., Kumar, A.: Approximation algorithms for the unsplittable flow problem. Algorithmica\u00a047(1), 53\u201378 (2007)","journal-title":"Algorithmica"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Chandra, R., Mahajan, R., Moscibroda, T., Raghavendra, R., Bahl, P.: A case for adapting channel width in wireless networks. In: SIGCOMM, pp. 135\u2013146 (2008)","DOI":"10.1145\/1402958.1402975"},{"issue":"1","key":"29_CR5","doi-asserted-by":"publisher","first-page":"137","DOI":"10.4086\/toc.2006.v002a007","volume":"2","author":"C. Chekuri","year":"2006","unstructured":"Chekuri, C., Khanna, S., Shepherd, F.B.: An O(sqrt(n)) approximation and integrality gap for disjoint paths and unsplittable flow. Theory of Computing\u00a02(1), 137\u2013146 (2006)","journal-title":"Theory of Computing"},{"key":"29_CR6","first-page":"1277","volume":"11","author":"E.A. Dinic","year":"1970","unstructured":"Dinic, E.A.: Algorithm for solution of a problem of maximum flow in a network with power estimation. Soviet Math. Doklady (Doklady)\u00a011, 1277\u20131280 (1970)","journal-title":"Soviet Math. Doklady (Doklady)"},{"issue":"2","key":"29_CR7","doi-asserted-by":"publisher","first-page":"248","DOI":"10.1145\/321694.321699","volume":"19","author":"J. Edmonds","year":"1972","unstructured":"Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM\u00a019(2), 248\u2013264 (1972)","journal-title":"Journal of the ACM"},{"issue":"4","key":"29_CR8","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1137\/0204043","volume":"4","author":"S. Even","year":"1975","unstructured":"Even, S., Tarjan, R.E.: Network flow and testing graph connectivity. SIAM J. Comput.\u00a04(4), 507\u2013518 (1975)","journal-title":"SIAM J. Comput."},{"key":"29_CR9","doi-asserted-by":"publisher","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 Journal of Mathematics\u00a08, 399\u2013404 (1956)","journal-title":"Canadian Journal of Mathematics"},{"issue":"5","key":"29_CR10","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1145\/290179.290181","volume":"45","author":"A.V. Goldberg","year":"1998","unstructured":"Goldberg, A.V., Rao, S.: Beyond the flow decomposition barrier. J. ACM\u00a045(5), 783\u2013797 (1998)","journal-title":"J. ACM"},{"issue":"4","key":"29_CR11","doi-asserted-by":"publisher","first-page":"921","DOI":"10.1145\/48014.61051","volume":"35","author":"A.V. Goldberg","year":"1988","unstructured":"Goldberg, A.V., Tarjan, R.E.: A new approach to the maximum-flow problem. J. ACM\u00a035(4), 921\u2013940 (1988)","journal-title":"J. ACM"},{"issue":"3","key":"29_CR12","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1016\/S0022-0000(03)00066-7","volume":"67","author":"V. Guruswami","year":"2003","unstructured":"Guruswami, V., Khanna, S., Rajaraman, R., Shepherd, F.B., Yannakakis, M.: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci.\u00a067(3), 473\u2013496 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"29_CR13","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"J.E. Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An n\n                    \n                      \n                    \n                    $^{\\mbox{5\/2}}$\n                   algorithm for maximum matchings in bipartite graphs. SIAM J. Comput.\u00a02(4), 225\u2013231 (1973)","journal-title":"SIAM J. Comput."},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Karger, D.R.: Using random sampling to find maximum flows in uncapacitated undirected graphs. In: STOC, pp. 240\u2013249 (1997)","DOI":"10.1145\/258533.258596"},{"key":"29_CR15","unstructured":"Karger, D.R.: Better random sampling algorithms for flows in undirected graphs. In: SODA, pp. 490\u2013499 (1998)"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Levine, M.S.: Finding maximum flows in undirected graphs seems easier than bipartite matching. In: STOC, pp. 69\u201378 (1998)","DOI":"10.1145\/276698.276714"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Karger, D.R., Levine, M.S.: Random sampling in residual graphs. In: STOC, pp. 63\u201366 (2002)","DOI":"10.1145\/509907.509918"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Kleinberg, J.M.: Single-source unsplittable flow. In: FOCS, pp. 68\u201377 (1996)","DOI":"10.1109\/SFCS.1996.548465"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Moscibroda, T., Chandra, R., Wu, Y., Sengupta, S., Bahl, P., Yuan, Y.: Load-Aware Spectrum Distribution in Wireless LANs. In: ICNP (2008)","DOI":"10.1109\/ICNP.2008.4697032"},{"issue":"1","key":"29_CR20","first-page":"10","volume":"37","author":"C.E. Shannon","year":"1949","unstructured":"Shannon, C.E.: Communication in the presence of noise. Proc. Institute of Radio Engineers\u00a037(1), 10\u201321 (1949)","journal-title":"Proc. Institute of Radio Engineers"},{"key":"29_CR21","doi-asserted-by":"crossref","unstructured":"Srinivasan, A.: Improved approximations for edge-disjoint paths, unsplittable flow, and related routing problems. In: FOCS, pp. 416\u2013425 (1997)","DOI":"10.1109\/SFCS.1997.646130"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02930-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T20:48:52Z","timestamp":1552078132000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02930-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642029295","9783642029301"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02930-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}