{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:16:50Z","timestamp":1763468210611,"version":"3.40.5"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319131221"},{"type":"electronic","value":"9783319131238"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-13123-8_6","type":"book-chapter","created":{"date-parts":[[2014,11,14]],"date-time":"2014-11-14T11:45:54Z","timestamp":1415965554000},"page":"59-78","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Efficient Primal-Dual Graph Algorithms for MapReduce"],"prefix":"10.1007","author":[{"given":"Bahman","family":"Bahmani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ashish","family":"Goel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kamesh","family":"Munagala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,13]]},"reference":[{"key":"6_CR1","first-page":"277","volume":"6","author":"FN Afrati","year":"2013","unstructured":"Afrati, F.N., Das Sarma, S., Salihoglu, S., Ullman, J.D.: Upper and lower bounds on the cost of a map-reduce computation. PVLDB 6, 277\u2013288 (2013)","journal-title":"PVLDB"},{"key":"6_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"526","DOI":"10.1007\/978-3-642-22012-8_42","volume-title":"Automata, Languages and Programming","author":"KJ Ahn","year":"2011","unstructured":"Ahn, K.J., Guha, S.: Linear programming in the semi-streaming model with application to the maximum matching problem. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011, Part II. LNCS, vol. 6756, pp. 526\u2013538. Springer, Heidelberg (2011)"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta algorithm and applications. Theory of Computing 8, 121\u2013164 (2012)","journal-title":"Theory of Computing"},{"key":"6_CR4","unstructured":"Awerbuch, B., Khandekar, R., Rao, S.: Distributed algorithms for multicommodity flow problems via approximate steepest descent framework. In: SODA, pp. 949\u2013957 (2007)"},{"issue":"5","key":"6_CR5","first-page":"454","volume":"5","author":"B Bahmani","year":"2012","unstructured":"Bahmani, B., Kumar, R., Vassilvitskii, S.: Densest subgraph in streaming and mapreduce. PVLDB 5(5), 454\u2013465 (2012)","journal-title":"PVLDB"},{"key":"6_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M Charikar","year":"2000","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 84\u201395. Springer, Heidelberg (2000)"},{"key":"6_CR7","unstructured":"Dean, J., Ghemawat, S.: Mapreduce: Simplified data processing on large clusters. In: OSDI, pp. 137\u2013150 (2004)"},{"issue":"2","key":"6_CR8","doi-asserted-by":"publisher","first-page":"630","DOI":"10.1137\/S0097539704446232","volume":"37","author":"N Garg","year":"2007","unstructured":"Garg, N., K\u00f6nemann, J.: Faster and simpler algorithms for multicommodity flow and other fractional packing problems. SIAM J. Comput. 37(2), 630\u2013652 (2007)","journal-title":"SIAM J. Comput."},{"key":"6_CR9","first-page":"477","volume":"75","author":"MD Grigoriadis","year":"1996","unstructured":"Grigoriadis, M.D., Khachiyan, L.G.: Approximate minimum-cost multicommodity flows in $$\\tilde{O}(\\epsilon ^{-2}knm)$$ time. Math. Program. 75, 477\u2013482 (1996)","journal-title":"Math. Program."},{"key":"6_CR10","unstructured":"Apache hadoop, http:\/\/hadoop.apache.org"},{"key":"6_CR11","unstructured":"Kannan, R., Vinay, V.: Analyzing the structure of large graphs. Manuscript (1999)"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"Karloff, H., Suri, S., Vassilvitskii, S.: A model of computation for mapreduce. In: SODA (2010)","DOI":"10.1137\/1.9781611973075.76"},{"key":"6_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/11830924_44","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"R Motwani","year":"2006","unstructured":"Motwani, R., Panigrahy, R., Xu, Y.: Fractional matching via balls-and-bins. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 487\u2013498. Springer, Heidelberg (2006)"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Plotkin, S.A., Shmoys, D.B., Tardos, \u00c9.:. Fast approximation algorithms for fractional packing and covering problems. In: FOCS, pp. 495\u2013504 (1991)","DOI":"10.1109\/SFCS.1991.185411"},{"key":"6_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"456","DOI":"10.1007\/978-3-642-12683-3_30","volume-title":"Research in Computational Molecular Biology","author":"B Saha","year":"2010","unstructured":"Saha, B., Hoch, A., Khuller, S., Raschid, L., Zhang, X.-N.: Dense subgraphs with restrictions and applications to gene annotation graphs. In: Berger, B. (ed.) RECOMB 2010. LNCS, vol. 6044, pp. 456\u2013472. Springer, Heidelberg (2010)"},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"Suri, S., Vassilvitskii, S.: Counting triangles and the curse of the last reducer. In: WWW, pp. 607\u2013614 (2011)","DOI":"10.1145\/1963405.1963491"},{"key":"6_CR17","unstructured":"Young, N.E.: Randomized rounding without solving the linear program. In: SODA (1995)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Models for the Web Graph"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13123-8_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T17:58:01Z","timestamp":1747159081000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13123-8_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319131221","9783319131238"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13123-8_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"13 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}