{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T22:39:59Z","timestamp":1729636799454,"version":"3.28.0"},"reference-count":17,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010,12]]},"DOI":"10.1109\/glocom.2010.5683581","type":"proceedings-article","created":{"date-parts":[[2011,1,10]],"date-time":"2011-01-10T16:19:12Z","timestamp":1294676352000},"page":"1-6","source":"Crossref","is-referenced-by-count":5,"title":["An Effective Approximation Scheme for Multiconstrained Quality-of-Service Routing"],"prefix":"10.1109","author":[{"given":"Jun","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohong","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Ma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.1.70"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1287\/moor.17.1.36"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(01)00069-4"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.890089"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.900712"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"851","DOI":"10.1109\/TNET.2004.836112","article-title":"Concepts of Exact QoS Routing Algorithms","volume":"12","author":"mieghem","year":"2004","journal-title":"IEEE\/ACM Trans Netw"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.815299"},{"journal-title":"BRITE","year":"0","key":"ref17"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/opre.25.6.920"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/49.536364"},{"key":"ref6","first-page":"271","article-title":"Primal-dual algorithms for computing weight-constrained shortest paths and weight -constrained minimum spanning trees","author":"xue","year":"2000","journal-title":"IEEE IPCC"},{"key":"ref5","first-page":"874","article-title":"On finding multi-constrained paths","author":"chen","year":"0","journal-title":"IEEE ICC98"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916274"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916277"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.897965"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2009.06.086"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1106159"}],"event":{"name":"GLOBECOM 2010 - 2010 IEEE Global Communications Conference","start":{"date-parts":[[2010,12,6]]},"location":"Miami, FL, USA","end":{"date-parts":[[2010,12,10]]}},"container-title":["2010 IEEE Global Telecommunications Conference GLOBECOM 2010"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5682081\/5683069\/05683581.pdf?arnumber=5683581","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,19]],"date-time":"2017-06-19T14:13:25Z","timestamp":1497881605000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5683581\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12]]},"references-count":17,"URL":"https:\/\/doi.org\/10.1109\/glocom.2010.5683581","relation":{},"subject":[],"published":{"date-parts":[[2010,12]]}}}