{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T20:06:22Z","timestamp":1725653182014},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2003,6,9]]},"DOI":"10.1145\/780542.780598","type":"proceedings-article","created":{"date-parts":[[2004,4,19]],"date-time":"2004-04-19T17:18:43Z","timestamp":1082395123000},"page":"373-382","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Meet and merge"],"prefix":"10.1145","author":[{"given":"Jiangzhuo","family":"Chen","sequence":"first","affiliation":[{"name":"Northeastern University, Boston, MA"}]},{"given":"Rajmohan","family":"Rajaraman","sequence":"additional","affiliation":[{"name":"Northeastern University, Boston, MA"}]},{"given":"Ravi","family":"Sundaram","sequence":"additional","affiliation":[{"name":"Akamai Technologies, Cambridge, MA"}]}],"member":"320","published-online":{"date-parts":[[2003,6,9]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"The Probabilistic Method","author":"Alon N.","year":"1991","unstructured":"N. Alon and J. H. Spencer . The Probabilistic Method . Wiley , New York, NY , 1991 . N. Alon and J. H. Spencer. The Probabilistic Method. Wiley, New York, NY, 1991."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539794285983"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780598"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/795664.796455"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1214\/aoap\/1019487349"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1063\/1.3034322"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1956-045-5"},{"key":"e_1_3_2_1_9_1","volume-title":"Flows in Networks","author":"Ford L.","year":"1962","unstructured":"L. Ford , Jr. and D. Fulkerson . Flows in Networks . Princeton University Press , Princeton, NJ , 1962 . L. Ford, Jr. and D. Fulkerson. Flows in Networks. Princeton University Press, Princeton, NJ, 1962."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(80)90009-2"},{"key":"e_1_3_2_1_11_1","volume-title":"Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Garg N.","year":"1998","unstructured":"N. Garg , G. Konjevod , and R. Ravi . A polylogarithmic approximation algorithm for the group steiner tree problem . In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms , 1998 . N. Garg, G. Konjevod, and R. Ravi. A polylogarithmic approximation algorithm for the group steiner tree problem. In Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, 1998."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380830"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240070202"},{"key":"e_1_3_2_1_14_1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"433","DOI":"10.1007\/3-540-57155-8_268","volume-title":"F. K. H. A. Dehne, J.-R","author":"Khuller S.","year":"1993","unstructured":"S. Khuller , B. Raghavachari , and N. Young . Designing multi-commodity flow trees . In F. K. H. A. Dehne, J.-R . Sack, N. Santoro, and S. Whitesides, editors, Proceedings of the 3rd Workshop on Algorithms and Data Structures, volume 709 of Lecture Notes in Computer Science , pages 433 -- 441 , Montreal, Canada, Aug. 1993 . Springer . S. Khuller, B. Raghavachari, and N. Young. Designing multi-commodity flow trees. In F. K. H. A. Dehne, J.-R. Sack, N. Santoro, and S. Whitesides, editors, Proceedings of the 3rd Workshop on Algorithms and Data Structures, volume 709 of Lecture Notes in Computer Science, pages 433--441, Montreal, Canada, Aug. 1993. Springer."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/795665.796474"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/874062.875508"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10038"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383070"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/331524.331526"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01200757"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1998.0930"},{"key":"e_1_3_2_1_23_1","first-page":"148","volume-title":"Surveys in Combinatorics","author":"McDiarmid C.","year":"1989","unstructured":"C. McDiarmid . On the method of bounded differences . In J. Siemons, editor, Surveys in Combinatorics , pages 148 -- 188 . Cambridge University Press , Cambridge, UK , 1989 . C. McDiarmid. On the method of bounded differences. In J. Siemons, editor, Surveys in Combinatorics, pages 148--188. Cambridge University Press, Cambridge, UK, 1989."},{"key":"e_1_3_2_1_24_1","volume-title":"Randomized Algorithms","author":"Motwani R.","year":"2000","unstructured":"R. Motwani and P. Raghavan . Randomized Algorithms . Cambridge University Press , Cambridge, UK , 2000 . R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, Cambridge, UK, 2000."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579324"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089548019223872X"},{"key":"e_1_3_2_1_27_1","volume-title":"Proc. of IEEE INFOCOM 2002","author":"Wang J.","year":"2002","unstructured":"J. Wang and K. Nahrstedt . Hop-by-hop routing algorithms for premium-class traffic in diffserv networks . In Proc. of IEEE INFOCOM 2002 , New York, NY , June 2002 . J. Wang and K. Nahrstedt. Hop-by-hop routing algorithms for premium-class traffic in diffserv networks. In Proc. of IEEE INFOCOM 2002, New York, NY, June 2002."}],"event":{"name":"STOC03: The 35th Annual ACM Symposium on Theory of Computing","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"San Diego CA USA","acronym":"STOC03"},"container-title":["Proceedings of the thirty-fifth annual ACM symposium on Theory of computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/780542.780598","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,6]],"date-time":"2023-01-06T05:35:33Z","timestamp":1672983333000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/780542.780598"}},"subtitle":["approximation algorithms for confluent flows"],"short-title":[],"issued":{"date-parts":[[2003,6,9]]},"references-count":25,"alternative-id":["10.1145\/780542.780598","10.1145\/780542"],"URL":"https:\/\/doi.org\/10.1145\/780542.780598","relation":{},"subject":[],"published":{"date-parts":[[2003,6,9]]},"assertion":[{"value":"2003-06-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}