{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T18:15:48Z","timestamp":1775326548393,"version":"3.50.1"},"reference-count":36,"publisher":"IEEE","license":[{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2009,4,1]],"date-time":"2009-04-01T00:00:00Z","timestamp":1238544000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,4]]},"DOI":"10.1109\/infcom.2009.5061962","type":"proceedings-article","created":{"date-parts":[[2009,6,3]],"date-time":"2009-06-03T15:10:14Z","timestamp":1244041814000},"page":"558-566","source":"Crossref","is-referenced-by-count":46,"title":["Polynomial Time Approximations for Multi-Path Routing with Bandwidth and Delay Constraints"],"prefix":"10.1109","author":[{"given":"S.","family":"Misra","sequence":"first","affiliation":[{"name":"CSE Dept., Arizona State Univ., Tempe, AZ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G.","family":"Xue","sequence":"additional","affiliation":[{"name":"CSE Dept., Arizona State Univ., Tempe, AZ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.","family":"Yang","sequence":"additional","affiliation":[{"name":"CSE Dept., Arizona State Univ., Tempe, AZ"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","first-page":"197","article-title":"a comparison of exact and -approximation algorithms for constrained routing","author":"kuipers","year":"0","journal-title":"IFIP Networking'2006"},{"key":"35","doi-asserted-by":"publisher","DOI":"10.1109\/90.993305"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1109\/TMM.2007.902852"},{"key":"36","doi-asserted-by":"publisher","DOI":"10.1109\/6046.944477"},{"key":"18","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.813047"},{"key":"33","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.900712"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.36"},{"key":"34","doi-asserted-by":"publisher","DOI":"10.1007\/BF01594937"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1287\/moor.25.1.36.15211"},{"key":"13","author":"garey","year":"1979","journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness"},{"key":"14","first-page":"854","article-title":"efficient computation of delay-sensitive routes from one source to all destinations","author":"goel","year":"2001","journal-title":"IEEE INFOCOM"},{"key":"11","author":"ford","year":"1962","journal-title":"Flows in Networks"},{"key":"12","first-page":"117","article-title":"supplying instantaneous video-on-demand services using controlled multicast; ieee","author":"gao","year":"1999","journal-title":"ICMCS"},{"key":"21","first-page":"191","article-title":"on path selection for traffic with bandwidth guarantees","author":"ma","year":"1997","journal-title":"IEEE ICNP"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(01)00069-4"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354543"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1998.659632"},{"key":"24","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832248"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1992.263431"},{"key":"26","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.836112"},{"key":"27","doi-asserted-by":"publisher","DOI":"10.1109\/49.536364"},{"key":"28","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"29","doi-asserted-by":"publisher","DOI":"10.1109\/76.911156"},{"key":"3","year":"0"},{"key":"2","doi-asserted-by":"crossref","DOI":"10.17487\/rfc2676","article-title":"qos routing mechanisms and ospf extensions","author":"apostolopoulos","year":"1999"},{"key":"10","author":"cormen","year":"2001","journal-title":"Introduction to Algorithms"},{"key":"1","first-page":"17","article-title":"quality of service based routing: a performance perspective","author":"apostolopoulos","year":"0","journal-title":"ACM SIG-COMM'1998"},{"key":"30","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.890089"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2004.836000"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2001.965916"},{"key":"32","year":"0"},{"key":"5","first-page":"5","article-title":"the confluent capacity of the internet: congestion vs. dilation","author":"chen","year":"0","journal-title":"IEEE ICDCS'06"},{"key":"31","doi-asserted-by":"publisher","DOI":"10.1109\/ICCI.1992.227714"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01415527"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/EURCON.2001.938167"},{"key":"8","first-page":"874","article-title":"on finding multi-constrained paths","author":"chen","year":"1998","journal-title":"IEEE ICC"}],"event":{"name":"2009 Proceedings IEEE INFOCOM","location":"Rio de Janeiro, Brazil","start":{"date-parts":[[2009,4,19]]},"end":{"date-parts":[[2009,4,25]]}},"container-title":["IEEE INFOCOM 2009"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5061887\/5061888\/05061962.pdf?arnumber=5061962","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,2]],"date-time":"2023-03-02T18:22:07Z","timestamp":1677781327000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5061962\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,4]]},"references-count":36,"URL":"https:\/\/doi.org\/10.1109\/infcom.2009.5061962","relation":{},"subject":[],"published":{"date-parts":[[2009,4]]}}}