{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T22:29:01Z","timestamp":1771453741826,"version":"3.50.1"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T00:00:00Z","timestamp":1459468800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/OAPA.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation (NSF) Information Technology Research","doi-asserted-by":"publisher","award":["ANI-0312435"],"award-info":[{"award-number":["ANI-0312435"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"U.S. Army Research Office","doi-asserted-by":"publisher","award":["W911NF-09-1-0467"],"award-info":[{"award-number":["W911NF-09-1-0467"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1217611"],"award-info":[{"award-number":["1217611"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1421685"],"award-info":[{"award-number":["1421685"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Emerg. Topics Comput."],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1109\/tetc.2015.2428654","type":"journal-article","created":{"date-parts":[[2015,5,6]],"date-time":"2015-05-06T14:56:58Z","timestamp":1430924218000},"page":"242-251","source":"Crossref","is-referenced-by-count":7,"title":["QoS Routing Under Multiple Additive Constraints: A Generalization of the LARAC Algorithm"],"prefix":"10.1109","volume":"4","author":[{"given":"Ying","family":"Xiao","sequence":"first","affiliation":[{"name":"VT iDirect Inc., Herndon, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krishnaiyan","family":"Thulasiraman","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Oklahoma, Norman, OK, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guoliang","family":"Xue","sequence":"additional","affiliation":[{"name":"School of Computing, Informatics and Decision Systems Engineering Arizona State University, Tempe, AZ, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mamta","family":"Yadav","sequence":"additional","affiliation":[{"name":"School of Computer Science, University of Oklahoma, Norman, OK, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2003.811420"},{"key":"ref38","first-page":"656","article-title":"Polynomial time approximation algorithms for multi-constrained QoS routing","volume":"16","author":"xue","year":"0","journal-title":"IEEE\/ACM Trans Netw"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2006.109"},{"key":"ref32","first-page":"63","article-title":"The constrained shortest path problem: Algorithmic approaches and an algebraic study with generalization","volume":"2","author":"xiao","year":"2005","journal-title":"AKCE Int'l J Graphs and Combinatorics"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/49.12889"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.1.70"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2006.890089"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TCSI.2006.869907"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/11602613_11"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2011.61"},{"key":"ref10","article-title":"On resource constrained optimization problems","author":"j\u00fcttner","year":"2005","journal-title":"Proc 4th Japanese-Hungarian Symp Discr Math Appl"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/90.993305"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480104445071"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2004.06.006"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916274"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2003.813047"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(01)00358-9"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1106159"},{"key":"ref17","article-title":"Multi-QoS constraints based routing for IP and ATM networks","author":"luo","year":"1999","journal-title":"Proc IEEE Workshop QoS Support Real Time Internet Appl"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.4.414"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45253-2_30"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2004.1354543"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.850222"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1002\/9781118033104"},{"key":"ref3","first-page":"157","article-title":"An approximate algorithm for combinatorial optimization problems with two parameters","volume":"14","author":"blokh","year":"1996","journal-title":"Austral J Combin"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230100403"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/49.536364"},{"key":"ref5","author":"garey","year":"1979","journal-title":"Command Intractability"},{"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\/TNET.2005.850217"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916277"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230190402"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(01)00222-5"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(99)00225-X"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2004.836112"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-0303-9_6"},{"key":"ref41","article-title":"Constrained shortest paths and related problems","author":"ziegelmann","year":"2001"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2000.892042"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.801397"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2002.1010339"}],"container-title":["IEEE Transactions on Emerging Topics in Computing"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6245516\/7484805\/07103034.pdf?arnumber=7103034","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,18]],"date-time":"2026-02-18T21:21:07Z","timestamp":1771449667000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/7103034\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,4]]},"references-count":41,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tetc.2015.2428654","relation":{},"ISSN":["2168-6750","2376-4562"],"issn-type":[{"value":"2168-6750","type":"electronic"},{"value":"2376-4562","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,4]]}}}