{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T19:40:25Z","timestamp":1736106025927,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540637578"},{"type":"electronic","value":"9783540696438"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0024499","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T07:30:56Z","timestamp":1132385456000},"page":"199-213","source":"Crossref","is-referenced-by-count":4,"title":["Off-line and on-line call-scheduling in stars and trees"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Erlebach","sequence":"first","affiliation":[]},{"given":"Klaus","family":"Jansen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"key":"18_CR1","unstructured":"Y. Aumann and Y. Rabani. Improved bounds for all optical routing. In Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms SODA '95, pages 567\u2013576, 1995."},{"key":"18_CR2","unstructured":"B. Awerbuch, Y. Bartal, A. Fiat, and A. Ros\u00e9n. Competitive non-preemptive call control. In Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms SODA '94, pages 312\u2013320, 1994."},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Y. Bartal and S. Leonardi. On-line routing in all-optical networks. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming ICALP '97, LNCS 1256, pages 516\u2013526. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63165-8_207"},{"issue":"3","key":"18_CR4","doi-asserted-by":"crossref","first-page":"744","DOI":"10.1137\/0214054","volume":"14","author":"E. Coffman Jr.","year":"1985","unstructured":"E. Coffman, Jr., M. Garey, D. Johnson, and A. Lapaugh. Scheduling file transfers. SIAM J. Comput., 14(3):744\u2013780, August 1985.","journal-title":"SIAM J. Comput."},{"key":"18_CR5","unstructured":"T. Erlebach and K. Jansen. Scheduling of virtual connections in fast networks. In Proceedings of the 4th Parallel Systems and Algorithms Workshop PASA '96, pages 13\u201332. World Scientific Publishing, 1997."},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"T. Erlebach and K. Jansen. Call scheduling in trees, rings and meshes. In Proceedings of the 30th Hawaii International Conference on System Sciences HICSS-30, volume 1, pages 221\u2013222. IEEE Computer Society Press, 1997.","DOI":"10.1109\/HICSS.1997.667220"},{"key":"18_CR7","volume-title":"Competitive analysis of call admission algorithms that allow delay. Technical Report CMU-CS95-102","author":"A. Feldmann","year":"1995","unstructured":"A. Feldmann, B. Maggs, J. So-all, D. D. Sleator, and A. Tomkins. Competitive analysis of call admission algorithms that allow delay. Technical Report CMU-CS95-102, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, January 1995."},{"key":"18_CR8","series-title":"Technical Report CMU-CS-95-201","volume-title":"On-line call admission for high-speed networks","author":"A. Feldmann","year":"1995","unstructured":"A. Feldmann. On-line call admission for high-speed networks (Ph.D. Thesis). Technical Report CMU-CS-95-201, School of Computer Science, Carnegie Mellon University, Pittsburgh, PA, October 1995."},{"issue":"2","key":"18_CR9","doi-asserted-by":"crossref","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"R. Graham","year":"1969","unstructured":"R. Graham. Bounds on multiprocessing timing anomalies. SIAM J. Appl. Math., 17(2):416\u2013429, March 1969.","journal-title":"SIAM J. Appl. Math."},{"key":"18_CR10","first-page":"165","volume-title":"Computer and Job-Shop Scheduling Theory","author":"R. Graham","year":"1976","unstructured":"R. Graham. Bounds on the performance of scheduling algorithms. In E. G. Coffman, Jr., editor, Computer and Job-Shop Scheduling Theory, pages 165\u2013227. John Wiley & Sons, Inc., New York, 1976."},{"key":"18_CR11","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0166-218X(94)90012-4","volume":"55","author":"J. Hoogeveen","year":"1994","unstructured":"J. Hoogeveen, S. van de Velde, and B. Veltman. Complexity of scheduling multiprocessor tasks with prespecified processor allocations. Discrete Appl. Math., 55:259\u2013272, 1994.","journal-title":"Discrete Appl. Math."},{"key":"18_CR12","doi-asserted-by":"crossref","unstructured":"C. Kaklamanis, P. Persiano, T. Erlebach, and K. Jansen. Constrained bipartite edge coloring with applications to wavelength routing. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming ICALP '97, LNCS 1256, pages 493\u2013504. Springer-Verlag, 1997.","DOI":"10.1007\/3-540-63165-8_205"},{"issue":"3","key":"18_CR13","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1137\/0403035","volume":"3","author":"T. Nishizeki","year":"1990","unstructured":"T. Nishizeki and K. Kashiwagi. On the 1.1 edge-coloring of multigraphs. SIAM J. Disc. Math., 3(3):391\u2013410, August 1990.","journal-title":"SIAM J. Disc. Math."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"D. B. Shmoys, J. Wein, and D. P. Williamson. Scheduling parallel machines online. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science FOGS '91, pages 131\u2013140, 1991.","DOI":"10.1109\/SFCS.1991.185361"},{"key":"18_CR15","unstructured":"The ATM Forum, Upper Saddle River, NJ. ATM User-Network Interface (UNI) Specification Version 3.1., 1995."},{"volume-title":"Handbook of Theoretical Computer Science. Volume A: Algorithms and complexity","year":"1990","key":"18_CR16","unstructured":"J. van Leeuwen, editor. Handbook of Theoretical Computer Science. Volume A: Algorithms and complexity. Elsevier North-Holland, Amsterdam, 1990."}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0024499","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T18:59:13Z","timestamp":1736103553000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0024499"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540637578","9783540696438"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/bfb0024499","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}