{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,8]],"date-time":"2025-01-08T05:41:18Z","timestamp":1736314878828,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540322078"},{"type":"electronic","value":"9783540322085"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11671411_15","type":"book-chapter","created":{"date-parts":[[2006,2,15]],"date-time":"2006-02-15T09:26:35Z","timestamp":1139995595000},"page":"190-202","source":"Crossref","is-referenced-by-count":1,"title":["Deterministic Online Optical Call Admission Revisited"],"prefix":"10.1007","author":[{"given":"Elisabeth","family":"Gassner","sequence":"first","affiliation":[]},{"given":"Sven O.","family":"Krumke","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"15_CR1","unstructured":"Adler, R., Azar, Y.: Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms. In: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1\u201310 (1999)"},{"key":"15_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/3-540-61680-2_73","volume-title":"Algorithms - ESA \u201996","author":"B. Awerbuch","year":"1996","unstructured":"Awerbuch, B., Azar, Y., Fiat, A., Leonardi, S., Ros\u00e9n, A.: On-line competitive algorithms for call admission in optical networks. In: D\u00edaz, J. (ed.) ESA 1996. LNCS, vol.\u00a01136, pp. 431\u2013444. Springer, Heidelberg (1996)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive online routing. In: Proceedings of the 34th Annual IEEE Symposium on the Foundations of Computer Science, pp. 32\u201340 (1993)","DOI":"10.1109\/SFCS.1993.366884"},{"key":"15_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Gawlick, R., Leighton, F.T., Rabani, R.: On-line admission control and curcuit routing for high performance computing and communication. In: Proceedings of the 35th Annual IEEE Symposium on the Foundations of Computer Science, pp. 412\u2013423 (1994)","DOI":"10.1109\/SFCS.1994.365675"},{"key":"15_CR5","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A., Ros\u00e9n, A.: Competitive, non-preemptive call control. In: Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 312\u2013320 (1994)"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., Canetti, R., Kutten, S., Mansour, Y., Schieber, B.: Bandwidth allocation with preemption. In: Proceedings of the 27th Annual ACM Symposium on the Theory of Computing, pp. 616\u2013625 (1995)","DOI":"10.1145\/225058.225279"},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Fiat, A., Leonardi, S.: Lower bounds for on-line graph problems with applications to on-line curcuit and optimal routing. In: Proceedings of the 28th Annual ACM Symposium on the Theory of Computing, pp. 531\u2013540 (1996)","DOI":"10.1145\/237814.238001"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Garay, J.A., Gopal, I.S.: Call preemption in communication networks. In: Proceedings of INFOCOM 1992, pp. 1043\u20131050 (1992)","DOI":"10.1109\/INFCOM.1992.263457"},{"issue":"1","key":"15_CR9","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jagm.1996.0821","volume":"23","author":"J.A. Garay","year":"1997","unstructured":"Garay, J.A., Gopal, I.S., Kutten, S., Mansour, Y., Yung, M.: Efficient on-line call control algorithms. Journal of Algorithms\u00a023(1), 180\u2013194 (1997)","journal-title":"Journal of Algorithms"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Kleinberg, J., Rubenfield, R.: Short paths in expander networks. In: Proceedings of the 37th Annual IEEE Symposium on the Foundations of Computer Science, pp. 86\u201395 (1996)","DOI":"10.1109\/SFCS.1996.548467"},{"key":"15_CR11","unstructured":"Kleinberg, J., Tardos, E.: Disjoint paths in densely embedded graphs. In: Proceedings of the 36th Annual IEEE Symposium on the Foundations of Computer Science, pp. 531\u2013540 (1995)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1007\/3-540-36379-3_29","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"S.O. Krumke","year":"2002","unstructured":"Krumke, S.O., Poensgen, D.: Online call admission in optical networks with larger wavelength demands. In: Ku\u010dera, L. (ed.) WG 2002. LNCS, vol.\u00a02573, pp. 333\u2013344. Springer, Heidelberg (2002)"},{"key":"15_CR13","unstructured":"Leonardi, S., Marchetti-Spaccamela, A., Presciutti, A., Ros\u00e8n, A.: On-line randomized call-control revisited. In: Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 323\u2013332 (1998)"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11671411_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,7]],"date-time":"2025-01-07T19:29:56Z","timestamp":1736278196000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11671411_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540322078","9783540322085"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11671411_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}