{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,27]],"date-time":"2026-09-27T03:02:46Z","timestamp":1790478166973,"version":"4.1.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540441861","type":"print"},{"value":"9783540457534","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-45753-4_19","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T07:37:09Z","timestamp":1187249829000},"page":"215-228","source":"Crossref","is-referenced-by-count":18,"title":["Routing and Admission Control in Networks with Advance Reservations"],"prefix":"10.1007","author":[{"given":"Liane","family":"Lewin-Eytan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Joseph Seffi","family":"Naor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ariel","family":"Orda","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,10,4]]},"reference":[{"issue":"3","key":"19_CR1","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"P.K. Agarwal","year":"1998","unstructured":"P.K. Agarwal, M. van Kreveld, ans S. Suri, \u201cLabel placement by maximum independent set in rectangles\u201d, Computational Geometry: Theory and applications, 11(3\u20134): 209\u2013218 (1998).","journal-title":"Computational Geometry: Theory and applications"},{"key":"19_CR2","unstructured":"T. Asano, \u201cDifficulty of the maximum independent set problem on intersection graphs of geometric objects\u201d, Proceedings of the Sixth Internat. Conf. on the Theory and Applications of Graphs, Western Michigan University 1988."},{"key":"19_CR3","doi-asserted-by":"crossref","first-page":"181","DOI":"10.7146\/math.scand.a-10607","volume":"8","author":"E. Asplund","year":"1960","unstructured":"E. Asplund, B. Grunbaum, \u201cOn a coloring problem\u201d, Math. Scand. 8 (1960), 181\u2013188.","journal-title":"Math. Scand."},{"key":"19_CR4","doi-asserted-by":"crossref","unstructured":"B. Awerbuch, Y. Azar, and S. Plotkin, \u201cThroughput-competitive online routing\u201d, Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993, pp. 32\u201340.","DOI":"10.1109\/SFCS.1993.366884"},{"key":"19_CR5","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1137\/S0895480196305124","volume":"12","author":"V. Bafna","year":"1999","unstructured":"V. Bafna, P. Berman, and T. Fujito, \u201cA 2-approximation algorithm for the undirected feedback vertex set problem\u201d, SIAM J. on Disc. Mathematics, Vol. 12, pp. 289\u2013297, 1999.","journal-title":"SIAM J. on Disc. Mathematics"},{"key":"19_CR6","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48","author":"A. Bar-Noy","year":"2001","unstructured":"A. Bar-Noy, R. Bar-Yehuda, A. Freund, J. Naor and B. Schieber, \u201cA unified approach to approximating resource allocation and scheduling\u201d, Journal of the ACM, Vol. 48 (2001), pp. 1069\u20131090.","journal-title":"Journal of the ACM"},{"key":"19_CR7","first-page":"27","volume":"25","author":"R. Bar-Yehuda","year":"1985","unstructured":"R. Bar-Yehuda and S. Even, \u201cA local-ratio theorem for approximating the weighted vertex cover problem\u201d, Annals of Discrete Mathematics, Vol. 25, pp. 27\u201346, 1985.","journal-title":"Annals of Discrete Mathematics"},{"key":"19_CR8","unstructured":"R. Bar-Yehuda, M. Halldorsson, J. Naor, H. Shachnai, and I. Shapira, \u201cScheduling split intervals\u201d, Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, (2002), pp. 732\u2013741."},{"key":"19_CR9","unstructured":"P. Berman, B. DasGupta, S. Muthukrishana, and S. Ramaswami, \u201cImproved approximation algorithms for rectangle tiling and packing\u201d, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 427\u2013436."},{"key":"19_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/BFb0024499","volume-title":"Off-line and on-line call-scheduling in stars and trees","author":"T. Erlebach","year":"1997","unstructured":"T. Erlebach and K. Jansen, \u201cOff-line and on-line call-scheduling in stars and trees\u201d, Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG\u201997) LNCS 1335, Springer Verlag, 1997, pp. 199\u2013213."},{"key":"19_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/3-540-49381-6_20","volume-title":"Maximizing the number of connections in optical tree networks","author":"T. Erlebach","year":"1998","unstructured":"T. Erlebach and K. Jansen, \u201cMaximizing the number of connections in optical tree networks\u201d, Proceedings of the Ninth Annual International Symposium on Algorithms and Computation (ISAAC\u201998) LNCS 1533, Springer Verlag, 1998, pp. 179\u2013188."},{"key":"19_CR12","unstructured":"T. Erlebach, K. Jansen, and E. Seidel, \u201cPolynomial-time approximation schemes for geometric graphs\u201d, Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, 2001, pp. 671\u2013679."},{"key":"19_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/0012-365X(85)90043-3","volume":"55","author":"M.C. Golumbic","year":"1985","unstructured":"M.C. Golumbic and R.E Jamison, \u201cEdge and vertex intersection of paths in a tree\u201d, Discrete Math. 55 (1985), 151\u2013159.","journal-title":"Discrete Math"},{"key":"19_CR14","doi-asserted-by":"crossref","unstructured":"R. Guerin and A. Orda, \u201cNetworks with advance reservations: the routing perspective\u201d, Proceedings of INFOCOM 2000, Tel-Aviv, Israel, April 2000.","DOI":"10.1109\/INFCOM.2000.832180"},{"key":"19_CR15","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1145\/321850.321853","volume":"21","author":"P.G.H. Lehot","year":"1974","unstructured":"P.G.H Lehot, \u201cAn optimal algorithm to detect a line graph and output its root graph\u201d, J. ACM 21 (1974) 569\u2013575.","journal-title":"J. ACM"},{"key":"19_CR16","unstructured":"W. Reinhardt. Advance resource reservation and its impact on reservation protocols. In Proceedings of Broadband Islands\u201995, Dublin, Ireland, September 1995."},{"key":"19_CR17","unstructured":"J. W. Roberts and K.-Q. Liao. Traffic models for the telecommunication services with advanced reservation. In Proceedings of the 11th Intl. Teletraffic Congress, Kyoto, Japan, June 1985. Paper 1.3-2."},{"key":"19_CR18","doi-asserted-by":"crossref","unstructured":"O. Schel\u00e9n and S. Pink. Sharing resources through advance reservations agents. In Proceedings of IWQoS\u201997, New York, NY, May 1997.","DOI":"10.1007\/978-0-387-35170-4_31"},{"key":"19_CR19","doi-asserted-by":"crossref","unstructured":"A. Schill, F. Breiter, and S. K\u00fchn. Design and evaluation of an advance resource reservation protocol on top of RSVP. In Proceedings of IFIP Broadband\u201998, Stuttgart, Germany, April 1998.","DOI":"10.1007\/978-0-387-35378-4_3"},{"key":"19_CR20","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"R. Tarjan","year":"1985","unstructured":"R. Tarjan, \u201cDecomposition by clique separators\u201d, Discrete Math. 55 (1985), 221\u2013231.","journal-title":"Discrete Math"},{"issue":"1","key":"19_CR21","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1109\/26.126712","volume":"40","author":"J. Virtamo","year":"1992","unstructured":"J. Virtamo. A model of reservation systems. IEEE. Trans. Commun., 40(1):109\u2013118, January 1992.","journal-title":"IEEE. Trans. Commun"},{"key":"19_CR22","doi-asserted-by":"crossref","unstructured":"D. Wischik and A. Greenberg. Admission control for booking ahead shared resources. In Proceedings of INFOCOM\u201998, San Francisco, CA, April 1998.","DOI":"10.1109\/INFCOM.1998.665112"}],"container-title":["Lecture Notes in Computer Science","Approximation Algorithms for Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45753-4_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T06:38:57Z","timestamp":1737355137000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45753-4_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540441861","9783540457534"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-45753-4_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}