{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T04:09:30Z","timestamp":1751688570080,"version":"3.41.0"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Scheduling"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1023\/a:1022933824889","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T22:16:51Z","timestamp":1049753811000},"page":"113-129","source":"Crossref","is-referenced-by-count":12,"title":["Beating the Logarithmic Lower Bound: Randomized Preemptive Disjoint Paths and Call Control Algorithms"],"prefix":"10.1007","volume":"6","author":[{"given":"Ran","family":"Adler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yossi","family":"Azar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5117035_CR1","unstructured":"Aggarwal, A., A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, and M. Sudan, \u201cEfficient routing and scheduling algorithms for optical networks,\u201d in Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 412-423."},{"issue":"3","key":"5117035_CR2","doi-asserted-by":"crossref","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J. Aspnes","year":"1997","unstructured":"Aspnes, J., Y. Azar, A. Fiat, S. Plotkin, and O. Waarts, \u201cOn-line routing of virtual circuits with applications to load balancing and machine scheduling,\u201d J. ACM, 44(3), 486-504 (1997). Also in Proc. 25th ACM STOC, 623\u2013631, 1993.","journal-title":"J. ACM"},{"key":"5117035_CR3","unstructured":"Aumann, Y. and Y. Rabani, \u201cImproved bounds for all optical routing,\u201d in Proc. 6th ACM-SIAM Symp. on Discrete Algorithms, 1995, pp. 567-576."},{"key":"5117035_CR4","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Y. Azar, A. Fiat, S. Leonardi, and A. Rosen, \u201cOn-line competitive algorithms for call admission in optical networks,\u201d in Proc. 4th Annual Eur. Symp. on, Algorithms, 1996, pp. 431-444.","DOI":"10.1007\/3-540-61680-2_73"},{"key":"5117035_CR5","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Y. Azar, and S. Plotkin, \u201cThroughput-competitive online routing,\u201d in 34th IEEE Symposium on Foundations of Computer Science, 1993, pp. 32-40.","DOI":"10.1109\/SFCS.1993.366884"},{"key":"5117035_CR6","unstructured":"Awerbuch, B., Y. Bartal, A. Fiat, and A. Ros\u00e9n, \u201cCompetitive non-preemptive call control,\u201d in Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 1994a, pp. 312-320."},{"key":"5117035_CR7","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., R. Gawlick, T. Leighton, and Y. Rabani, \u201cOn-line admission control and circuit routing for high performance computation and communication,\u201d in Proc. 35th IEEE Symp. on Found. of Comp. Science, 1994, pp. 412-423.","DOI":"10.1109\/SFCS.1994.365675"},{"key":"5117035_CR8","doi-asserted-by":"crossref","unstructured":"Bar-Noy, A., R. Canetti, S. Kutten, Y. Mansour, and B. Schieber, \u201cBandwidth allocation with preemption,\u201d in Proc. 27th ACM Symp. on Theory of Computing, 1995, pp. 616-625.","DOI":"10.1145\/225058.225279"},{"key":"5117035_CR9","doi-asserted-by":"crossref","unstructured":"Bartal, Y., A. Fiat, and S. Leonardi, \u201cLower bounds for on-line graph problems with application to on-line circuit and optical routing,\u201d in Proc. 28th ACM Symp. on Theory of Computing, 1996, pp. 531-540.","DOI":"10.1145\/237814.238001"},{"key":"5117035_CR10","unstructured":"Borodin, A. and R. El-Yaniv, Online Computation and Competitive Analysis. Cambridge University Press, 1998"},{"key":"5117035_CR11","doi-asserted-by":"crossref","unstructured":"Canetti, R. and Irani, S., \u201cBouding the power of preemption in randomized scheduling,\u201d in Proc. 27th ACM Symp. on Theory of Computing, 1995, pp. 606-615.","DOI":"10.1145\/225058.225278"},{"key":"5117035_CR12","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1006\/jagm.1996.0821","volume":"23","author":"J. Garay","year":"1997","unstructured":"Garay, J., I. Gopal, S. Kutten, Y. Mansour, and M. Yung, \u201cEfficient on-line call control algorithms,\u201d J. Algorithms, 23, 180-194 (1997). Also in Proc. 2'nd Annu Israel Conference on Theory of Computing and Systems, 1993.","journal-title":"J. Algorithms"},{"key":"5117035_CR13","unstructured":"Golumbic, M., Algorithmic Graph Theory and Perfect Graphs, Academic Press, 1993."},{"key":"5117035_CR14","doi-asserted-by":"crossref","unstructured":"Kleinberg, J. and E. Tardos, \u201cApproximations for the disjoint paths problem in high-diameter planar networks,\u201d in Proc. 27th ACM Symp. on Theory of Computing, 1995a, pp. 26-35.","DOI":"10.1145\/225058.225075"},{"key":"5117035_CR15","doi-asserted-by":"crossref","unstructured":"Kleinberg J. and E. Tardos, \u201cDisjoint paths in densely embedded graphs,\u201d in Proc. 36th IEEE Symp. on Found. of Comp. Science, 1995b, pp. 52-61.","DOI":"10.1109\/SFCS.1995.492462"},{"key":"5117035_CR16","doi-asserted-by":"crossref","unstructured":"Leonardi, S., \u201cOn-line network routing,\u201d in A. Fiat and G. Woeginger (eds.), Online Algorithms\u2014The State of the Art, chapter 11, Springer, 1998, pp. 242-267.","DOI":"10.1007\/BFb0029572"},{"key":"5117035_CR17","unstructured":"Leonardi S., A. Marchetti-Spaccamela, A. Presciutti, and A. Ros\u00e9n, \u201cOn-line randomized call control revisited,\u201d in Proc. 9th ACM-SIAM Symp. on Discrete Algorithms, 1998, pp. 323-332."},{"key":"5117035_CR18","unstructured":"Lipton, R. J. and A. Tomkins, \u201cOnline interval scheduling,\u201d in Proc. 5th ACM-SIAM Symp. on Discrete Algorithms, 1994, pp. 302-311."},{"key":"5117035_CR19","doi-asserted-by":"crossref","unstructured":"Raghavan, P. and E. Upfal, \u201cEfficient routing in all-optical networks,\u201d in Proc. 26th ACM Symp. on Theory of Computing, 1994, pp. 134-143.","DOI":"10.1145\/195058.195119"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022933824889.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1022933824889\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1022933824889.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,4]],"date-time":"2025-07-04T12:51:38Z","timestamp":1751633498000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1022933824889"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["5117035"],"URL":"https:\/\/doi.org\/10.1023\/a:1022933824889","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}