{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T15:48:13Z","timestamp":1649000893671},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,7,4]],"date-time":"2007-07-04T00:00:00Z","timestamp":1183507200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2008,1]]},"DOI":"10.1007\/s00224-007-9010-0","type":"journal-article","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T16:27:19Z","timestamp":1183480039000},"page":"2-26","source":"Crossref","is-referenced-by-count":1,"title":["Traffic Engineering of Management Flows by Link Augmentations on Confluent Trees"],"prefix":"10.1007","volume":"42","author":[{"given":"Randeep","family":"Bhatia","sequence":"first","affiliation":[]},{"given":"Nicole","family":"Immorlica","sequence":"additional","affiliation":[]},{"given":"Tracy","family":"Kimbrel","sequence":"additional","affiliation":[]},{"given":"Vahab S.","family":"Mirrokni","sequence":"additional","affiliation":[]},{"given":"Joseph (Seffi)","family":"Naor","sequence":"additional","affiliation":[]},{"given":"Baruch","family":"Schieber","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,7,4]]},"reference":[{"key":"9010_CR1","doi-asserted-by":"crossref","unstructured":"Applegate, D., Cohen, E.: Making intra-domain routing robust to changing and uncertain traffic demands: understanding fundamental tradeoffs. In: ACM SIGCOMM, 2003","DOI":"10.1145\/863955.863991"},{"key":"9010_CR2","doi-asserted-by":"crossref","unstructured":"Bejerano, Y., Rastogi, R.: Robust monitoring of link delays and faults in IP networks. In: IEEE INFOCOM, 2003","DOI":"10.1109\/INFCOM.2003.1208666"},{"key":"9010_CR3","doi-asserted-by":"crossref","unstructured":"Bienkowski, M., Korzeniowski, M., R\u00e4cke, H.: A practical algorithm for constructing oblivious routing schemes. In: 15th Annual ACM Symp. on Parallel Algorithms and Architectures (SPAA), pp. 24\u201333 (2003)","DOI":"10.1145\/777412.777418"},{"key":"9010_CR4","doi-asserted-by":"crossref","unstructured":"Breitbart, Y., Chan, C.Y., Garofalakis, M., Rastogi, R., Silberschatz, A.: Efficiently monitoring bandwidth and latency in ip networks. In: IEEE INFOCOM, 2001","DOI":"10.1109\/INFCOM.2001.916285"},{"key":"9010_CR5","doi-asserted-by":"crossref","unstructured":"Chen, J., Rajaraman, R., Sundaram, R.: Meet and merge: approximation algorithms for confluent flow. In: Symp. on Theory of Computing (STOC), pp. 373\u2013382 (2003)","DOI":"10.1145\/780542.780598"},{"key":"9010_CR6","doi-asserted-by":"crossref","unstructured":"Chen, J., Kleinberg, R., Lovasz, L., Rajaraman, R., Sundaram, R., Vetta, A.: (Almost) tight bounds and existence theorems for confluent flows. In: Symp. on Theory of Computing (STOC), pp. 529\u2013538 (2004)","DOI":"10.1145\/1007352.1007432"},{"key":"9010_CR7","volume-title":"Flows in Network","author":"L. Ford","year":"1962","unstructured":"Ford, L., Fulkerson, D.: Flows in Network. Princeton University Press, Princeton (1962)"},{"issue":"4","key":"9010_CR8","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1109\/JSAC.2002.1003042","volume":"20","author":"B. Fortz","year":"2002","unstructured":"Fortz, B., Thorup, M.: Optimizing OSPF\/IS-IS weights in a changing world. IEEE J. Sel. Areas Commun. 20(4), 756\u2013767 (2002)","journal-title":"IEEE J. Sel. Areas Commun."},{"key":"9010_CR9","doi-asserted-by":"crossref","unstructured":"Fortz, B., Rexford, J., Thorup, M.: Internet traffic engineering by optimizing OSPF weights. In: IEEE INFOCOM, pp. 118\u2013124 (2000)","DOI":"10.1109\/INFCOM.2000.832225"},{"issue":"10","key":"9010_CR10","doi-asserted-by":"crossref","first-page":"118","DOI":"10.1109\/MCOM.2002.1039866","volume":"40","author":"B. Fortz","year":"2002","unstructured":"Fortz, B., Rexford, J., Thorup, M.: Traffic engineering with traditional IP routing protocols. IEEE Commun. Mag. 40(10), 118\u2013124 (2002)","journal-title":"IEEE Commun. Mag."},{"key":"9010_CR11","unstructured":"Frank, A.: Connectivity augmentation problems in network design. In: Mathematical Programming: State of the Art, pp. 34\u201363 (1994)"},{"key":"9010_CR12","unstructured":"Iyer, S., Bhattacharrya, S., Taft, N., Diot, C.: An approach to alleviate link overload as observed on an IP backbone. In: IEEE INFOCOM, 2003"},{"key":"9010_CR13","doi-asserted-by":"crossref","unstructured":"Jamin, S., Jin, C., Jin, Y., Raz, D., Shavitt, Y., Zhang, L.: On the placement of Internet instrumentation. In: IEEE INFOCOM, 2000","DOI":"10.1109\/INFCOM.2000.832199"},{"key":"9010_CR14","volume-title":"Approximation algorithms for disjoint paths problems","author":"J. Kleinberg","year":"1996","unstructured":"Kleinberg, J.: Approximation algorithms for disjoint paths problems. Ph.D. Thesis, MIT (1996)"},{"key":"9010_CR15","doi-asserted-by":"crossref","unstructured":"Kumar, A., Rastogi, R., Siberschatz, A., Yener, B.: Algorithms for provisioning virtual private networks in the hose model. In: ACM SIGCOMM, pp. 135\u2013148 (2001)","DOI":"10.1145\/383059.383070"},{"key":"9010_CR16","doi-asserted-by":"crossref","unstructured":"Li, L., Thottan, M., Yao, B., Paul, S.: Distributed network monitoring with bounded link utilization in ip networks. In: IEEE INFOCOM, 2003","DOI":"10.1109\/INFCOM.2003.1208955"},{"key":"9010_CR17","unstructured":"Lorenz, D., Orda, A., Raz, D., Shavit, Y.: How good can IP routing be? In: DIMACS Technical Report: 2001-17 (2001)"},{"key":"9010_CR18","unstructured":"Wang, J., Nahrsdedt, K.: Hop-by-hop routing algorithms for premimum-class traffic in diffserv networks. In: IEEE INFOCOM, 2002"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9010-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-007-9010-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-007-9010-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T11:51:34Z","timestamp":1558698694000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-007-9010-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,7,4]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["9010"],"URL":"https:\/\/doi.org\/10.1007\/s00224-007-9010-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,7,4]]}}}