{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T09:28:42Z","timestamp":1725614922029},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,7,18]]},"DOI":"10.1145\/1073970.1074018","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T08:31:47Z","timestamp":1123057907000},"page":"289-298","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Traffic engineering of management flows by link augmentations on confluent trees"],"prefix":"10.1145","author":[{"given":"Randeep","family":"Bhatia","sequence":"first","affiliation":[{"name":"Lucent Tech., Murray Hill, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicole","family":"Immorlica","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tracy","family":"Kimbrel","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Ctr, Yorktown Heights, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vahab S.","family":"Mirrokni","sequence":"additional","affiliation":[{"name":"MIT, Cambridge, MA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Seffi","family":"Naor","sequence":"additional","affiliation":[{"name":"Technion, Haifa, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, Yorktown Heights, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,7,18]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863991"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208666"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/777412.777418"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916285"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1007352.1007432"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780598"},{"key":"e_1_3_2_1_7_1","volume-title":"Flows in Network","author":"Ford L.","year":"1962","unstructured":"L. Ford and D. Fulkerson . Flows in Network . Princeton University Press , 1962 . L. Ford and D. Fulkerson. Flows in Network. Princeton University Press, 1962."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832225"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1039866"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1003042"},{"key":"e_1_3_2_1_11_1","first-page":"34","volume-title":"Connectivity augmentation problems in network design. Mathematical Programming: state of the art","author":"Frank A.","year":"1994","unstructured":"A. Frank . Connectivity augmentation problems in network design. Mathematical Programming: state of the art , pages 34 -- 63 , 1994 . A. Frank. Connectivity augmentation problems in network design. Mathematical Programming: state of the art, pages 34--63, 1994."},{"key":"e_1_3_2_1_12_1","volume-title":"IEEE INFOCOM","author":"Iyer S.","year":"2003","unstructured":"S. Iyer , S. Bhattacharrya , N. Taft , and C. Diot . An approach to alleviate link overload as observed on an IP backbone . In IEEE INFOCOM , 2003 . S. Iyer, S. Bhattacharrya, N. Taft, and C. Diot. An approach to alleviate link overload as observed on an IP backbone. In IEEE INFOCOM, 2003."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832199"},{"key":"e_1_3_2_1_14_1","volume-title":"MIT","author":"Kleinberg J.","year":"1996","unstructured":"J. Kleinberg . Approximation algorithms for disjoint paths problems. Phd Thesis , MIT , 1996 . J. Kleinberg. Approximation algorithms for disjoint paths problems. Phd Thesis, MIT, 1996."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383070"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2003.1208955"},{"key":"e_1_3_2_1_17_1","volume-title":"How good can IP routing be? In DIMACS technical report: 2001-17","author":"Lorenz D.","year":"2001","unstructured":"D. Lorenz , A. Orda , D. Raz , and Y. Shavit . How good can IP routing be? In DIMACS technical report: 2001-17 , 2001 . D. Lorenz, A. Orda, D. Raz, and Y. Shavit. How good can IP routing be? In DIMACS technical report: 2001-17, 2001."},{"key":"e_1_3_2_1_18_1","volume-title":"IEEE INFOCOM","author":"Wang J.","year":"2002","unstructured":"J. Wang and K. Nahrsdedt . Hop-by-hop routing algorithms for premimum-class traffic in diffserv networks . In IEEE INFOCOM , 2002 . J. Wang and K. Nahrsdedt. Hop-by-hop routing algorithms for premimum-class traffic in diffserv networks. In IEEE INFOCOM, 2002."}],"event":{"name":"SPAA05: 17th ACM Symposium on Parallelism in Algorithms and Architectures 2005","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture"],"location":"Las Vegas Nevada USA","acronym":"SPAA05"},"container-title":["Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1073970.1074018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T02:24:24Z","timestamp":1673144664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1073970.1074018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,7,18]]},"references-count":18,"alternative-id":["10.1145\/1073970.1074018","10.1145\/1073970"],"URL":"https:\/\/doi.org\/10.1145\/1073970.1074018","relation":{},"subject":[],"published":{"date-parts":[[2005,7,18]]},"assertion":[{"value":"2005-07-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}