{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T10:50:53Z","timestamp":1758279053069},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2003,10,1]],"date-time":"2003-10-01T00:00:00Z","timestamp":1064966400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computer Networks"],"published-print":{"date-parts":[[2003,10]]},"DOI":"10.1016\/s1389-1286(03)00286-x","type":"journal-article","created":{"date-parts":[[2003,5,19]],"date-time":"2003-05-19T16:52:26Z","timestamp":1053363146000},"page":"351-367","source":"Crossref","is-referenced-by-count":12,"title":["Efficient QoS routing"],"prefix":"10.1016","volume":"43","author":[{"given":"Stavroula","family":"Siachalou","sequence":"first","affiliation":[]},{"given":"Leonidas","family":"Georgiadis","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S1389-1286(03)00286-X_BIB1","series-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja","year":"1993"},{"key":"10.1016\/S1389-1286(03)00286-X_BIB2","unstructured":"D. Blokh, G. Gutin, An approximation algorithm for combinatorial optimization problems with two parameters, IMADA preprint PP-1995-14, May 1995"},{"key":"10.1016\/S1389-1286(03)00286-X_BIB3","unstructured":"S. Chen, C. Nahrstedt, On finding multi-constrained paths, in: Proceedings of IEEE ICC\u201998, Atlanta, GA, 1998"},{"key":"10.1016\/S1389-1286(03)00286-X_BIB4","doi-asserted-by":"crossref","first-page":"596","DOI":"10.1145\/28869.28874","article-title":"Fibonacci heaps and their uses in improved network optimization algorithms","volume":"34","author":"Fredman","year":"1987","journal-title":"Journal of the ACM"},{"key":"10.1016\/S1389-1286(03)00286-X_BIB5","series-title":"Computer and Intractability: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1978"},{"key":"10.1016\/S1389-1286(03)00286-X_BIB6","doi-asserted-by":"crossref","unstructured":"A. Goel, K.G. Ramakrishnan, D. Kataria, D. Logothetis, Efficient computation of delay-sensitive routes from one source to all destinations, in: Proceedings of IEEE INFOCOM\u201901, Anchorage, AK, April 2001","DOI":"10.1109\/INFCOM.2001.916276"},{"issue":"5","key":"10.1016\/S1389-1286(03)00286-X_BIB7","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1109\/TNET.2002.803917","article-title":"Computing shortest paths for any number of hops","volume":"10","author":"Guerin","year":"2002","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"1","key":"10.1016\/S1389-1286(03)00286-X_BIB8","doi-asserted-by":"crossref","first-page":"36","DOI":"10.1287\/moor.17.1.36","article-title":"Approximation schemes for the restricted shortest path problem","volume":"17","author":"Hassin","year":"1992","journal-title":"Mathematics of Operations Research"},{"issue":"3","key":"10.1016\/S1389-1286(03)00286-X_BIB9","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/S0140-3664(01)00358-9","article-title":"An efficient algorithm for finding a path subject to two additive constraints","volume":"25","author":"Korkmaz","year":"2002","journal-title":"Computer Communications"},{"issue":"5","key":"10.1016\/S1389-1286(03)00286-X_BIB10","doi-asserted-by":"crossref","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","article-title":"A simple efficient approximation scheme for the restricted shortest path problem","volume":"28","author":"Lorenz","year":"2001","journal-title":"Operations Research Letters"},{"key":"10.1016\/S1389-1286(03)00286-X_BIB11","doi-asserted-by":"crossref","unstructured":"D.H. Lorenz, A. Orda, D. Raz, Y. Shavitt, Efficient QoS Partition and Routing of Unicast and Multicast, in: Proceedings IEEE\/IFIP IWQoS, Pittsburgh, PA, June 2000","DOI":"10.1109\/IWQOS.2000.847940"},{"key":"10.1016\/S1389-1286(03)00286-X_BIB12","doi-asserted-by":"crossref","unstructured":"Q. Ma, P. Steenkiste, Quality of service routing for traffic with performance guarantees, IWQoS\u201997, May 1997","DOI":"10.1007\/978-0-387-35170-4_12"},{"key":"10.1016\/S1389-1286(03)00286-X_BIB13","series-title":"Leda: A Platform for Combinatorial and Geometric Computing","author":"Mehlhorn","year":"2000"},{"key":"10.1016\/S1389-1286(03)00286-X_BIB14","doi-asserted-by":"crossref","unstructured":"Q. Sun, H. Langendorfer, A new distributed routing algorithm with end-to-end delay guarantee, IWQoS\u201997, May 1997","DOI":"10.1007\/BFb0000343"},{"issue":"7","key":"10.1016\/S1389-1286(03)00286-X_BIB15","first-page":"1228","article-title":"QoS routing for supporting resource reservation","volume":"14","author":"Wang","year":"1996","journal-title":"IEEE Journal on Selected Areas in Computing"},{"key":"10.1016\/S1389-1286(03)00286-X_BIB16","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1287\/opre.35.1.70","article-title":"Approximation of Pareto optima in multiple objective shortest path problems","volume":"35","author":"Warburton","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S1389-1286(03)00286-X_BIB17","unstructured":"The Power Law Simulator, <http:\/\/www.cs.bu.edu\/brite>"},{"key":"10.1016\/S1389-1286(03)00286-X_BIB18","unstructured":"The Real Networks, <http:\/\/moat.nlanr.net\/Routing\/rawdata>"}],"container-title":["Computer Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S138912860300286X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S138912860300286X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,20]],"date-time":"2020-03-20T00:43:41Z","timestamp":1584665021000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S138912860300286X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,10]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2003,10]]}},"alternative-id":["S138912860300286X"],"URL":"https:\/\/doi.org\/10.1016\/s1389-1286(03)00286-x","relation":{},"ISSN":["1389-1286"],"issn-type":[{"value":"1389-1286","type":"print"}],"subject":[],"published":{"date-parts":[[2003,10]]}}}