{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T23:00:59Z","timestamp":1746918059995,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540341925"},{"type":"electronic","value":"9783540341932"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753810_17","type":"book-chapter","created":{"date-parts":[[2006,4,28]],"date-time":"2006-04-28T04:11:58Z","timestamp":1146197518000},"page":"197-208","source":"Crossref","is-referenced-by-count":14,"title":["A Comparison of Exact and \u03b5 -Approximation Algorithms for Constrained Routing"],"prefix":"10.1007","author":[{"given":"Fernando","family":"Kuipers","sequence":"first","affiliation":[]},{"given":"Ariel","family":"Orda","sequence":"additional","affiliation":[]},{"given":"Danny","family":"Raz","sequence":"additional","affiliation":[]},{"given":"Piet","family":"Van Mieghem","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness, Freeman, San Francisco (1979)"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Goel, A., Ramakrishnan, K.G., Kataria, D., Logothetis, D.: Efficient Computation of Delay-sensitive Routes from One Source to All Destinations. In: Proc. of IEEE INFOCOM, pp. 854\u2013858 (2001)","DOI":"10.1109\/INFCOM.2001.916276"},{"issue":"1","key":"17_CR3","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1287\/moor.17.1.36","volume":"17","author":"R. Hassin","year":"1992","unstructured":"Hassin, R.: Approximation schemes for the restricted shortest path problem. Mathematics of Operations Research\u00a017(1), 36\u201342 (1992)","journal-title":"Mathematics of Operations Research"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Kuipers, F.A., Van Mieghem, P.: The impact of correlated link weights on QoS routing. In: Proc. of the IEEE INFOCOM Conference, vol.\u00a02, pp. 1425\u20131434 (April 2003)","DOI":"10.1109\/INFCOM.2003.1208978"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Kuipers, F.A., Korkmaz, T., Krunz, M., Van Mieghem, P.: Performance Evaluation of Constraint-Based Path Selection Algorithms. IEEE Network\u00a018(5), 16\u201323 (2004)","DOI":"10.1109\/MNET.2004.1337731"},{"issue":"5","key":"17_CR6","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/S0167-6377(01)00069-4","volume":"28","author":"D.H. Lorenz","year":"2001","unstructured":"Lorenz, D.H., Raz, D.: A simple efficient approximation scheme for the restricted shortest path problem. Operations Research Letter\u00a028(5), 213\u2013219 (2001)","journal-title":"Operations Research Letter"},{"issue":"3","key":"17_CR7","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1109\/90.779205","volume":"7","author":"A. Orda","year":"1999","unstructured":"Orda, A.: Routing with end-to-end QoS guarantees in broadband networks. IEEE\/ACM Transactions on Networking\u00a07(3), 365\u2013374 (1999)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Van Mieghem, P.: Paths in the simple random graph and the waxman graph. In: Probability in the Engineering and Informational Sciences (PEIS), vol.\u00a015, pp. 535\u2013555 (2001)","DOI":"10.1017\/S0269964801154070"},{"issue":"5","key":"17_CR9","doi-asserted-by":"publisher","first-page":"851","DOI":"10.1109\/TNET.2004.836112","volume":"12","author":"P. Mieghem Van","year":"2004","unstructured":"Van Mieghem, P., Kuipers, F.A.: Concepts of exact quality of service algorithms. IEEE\/ACM Transactions on Networking\u00a012(5), 851\u2013864 (2004)","journal-title":"IEEE\/ACM Transactions on Networking"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2006. Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753810_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,14]],"date-time":"2020-04-14T07:05:06Z","timestamp":1586847906000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753810_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341925","9783540341932"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11753810_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}