{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,26]],"date-time":"2025-10-26T13:58:40Z","timestamp":1761487120837,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/icc.2003.1204174","type":"proceedings-article","created":{"date-parts":[[2004,3,22]],"date-time":"2004-03-22T09:34:28Z","timestamp":1079948068000},"page":"223-227","source":"Crossref","is-referenced-by-count":6,"title":["Routing with many additive QoS constraints"],"prefix":"10.1109","volume":"1","author":[{"family":"Guoliang Xue","sequence":"first","affiliation":[]},{"given":"A.","family":"Sen","sequence":"additional","affiliation":[]},{"given":"R.","family":"Banka","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/S1389-1286(00)00209-7","article-title":"Mult-constrained optimal path selection","volume":"36","author":"korkmaz","year":"2001","journal-title":"Computer Networks"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(01)00069-4"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/7.4.308"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2002.1010339"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.1997.635117"},{"key":"ref15","first-page":"2129","article-title":"Bandwidth-delay-based routing algorithms","author":"wang","year":"0","journal-title":"IEEE Globecom'95"},{"key":"ref16","doi-asserted-by":"crossref","first-page":"1228","DOI":"10.1109\/49.536364","article-title":"Quality-of-service routing for supporting multimedia applications","volume":"14","author":"wang","year":"1996","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.1.70"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/65.768484"},{"key":"ref19","first-page":"844","article-title":"Heuristic Algorithms for Multi-constrained QoS routing","author":"yuan","year":"0","journal-title":"IEEE INFOCOM'01"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/28869.28874"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2000.832182"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916276"},{"journal-title":"Computers and Intractability A Guide to the Theory of NP-Completeness","year":"1979","author":"garey","key":"ref5"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230140109"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.36"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/65.752646"},{"key":"ref1","first-page":"874","article-title":"On finding multi-constrained paths","author":"chen","year":"0","journal-title":"IEEE ICC'98"},{"key":"ref9","first-page":"834","article-title":"A randomized algorithm for finding a path subject top multiple QoS requirements","author":"korkmaz","year":"0","journal-title":"IEEE INFOCOM'01"},{"key":"ref20","first-page":"271","article-title":"Primal-dual algorithms for computing weight-constrained shortest paths and weight-constrained minimum spanning trees","author":"xue","year":"0","journal-title":"IEEE IPCCC2000"}],"event":{"name":"IEEE International Conference on Communications","acronym":"ICC-03","location":"Anchorage, AK, USA"},"container-title":["IEEE International Conference on Communications, 2003. ICC '03."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8564\/27113\/01204174.pdf?arnumber=1204174","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T00:25:50Z","timestamp":1497572750000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1204174\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/icc.2003.1204174","relation":{},"subject":[]}}