乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T06:06:51Z","timestamp":1725516411792},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699002"},{"type":"electronic","value":"9783540699033"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-69903-3_29","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T16:07:43Z","timestamp":1218557263000},"page":"319-330","source":"Crossref","is-referenced-by-count":0,"title":["A Preemptive Algorithm for Maximizing Disjoint Paths on Trees"],"prefix":"10.1007","author":[{"given":"Yossi","family":"Azar","sequence":"first","affiliation":[]},{"given":"Uriel","family":"Feige","sequence":"additional","affiliation":[]},{"given":"Daniel","family":"Glasner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","unstructured":"Adler, R., Azar, Y.: Beating the logarithmic lower bound: randomized preemptive disjoint paths and call control algorithms. In: Proc. of the 10th ACM-SIAM Symposium on Discrete Algorithms, pp. 1\u201310 (1999)"},{"key":"29_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/978-3-540-48413-4_3","volume-title":"Randomization, Approximation, and Combinatorial Optimization. Algorithms and Techniques","author":"N. Alon","year":"1999","unstructured":"Alon, N., Arad, U., Azar, Y.: Independent sets in hypergraphs with applications to routing via fixed paths. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol.\u00a01671, pp. 16\u201327. Springer, Heidelberg (1999)"},{"key":"29_CR3","unstructured":"Andrews, M., Chuzhoy, J., Khanna, S., Zhang, L.: Hardness of the undirected edge-disjoint paths problem with congestion. In: Proceedings 46th Annual IEEE Symposium on Foundations of Computer Science, pp. 226\u2013244 (2005)"},{"issue":"3","key":"29_CR4","doi-asserted-by":"publisher","first-page":"486","DOI":"10.1145\/258128.258201","volume":"44","author":"J. Aspnes","year":"1997","unstructured":"Aspnes, J., Azar, Y., Fiat, A., Plotkin, S., Waarts, O.: On-line routing of virtual circuits with applications to load balancing and machine scheduling. Journal of the ACM\u00a044(3), 486\u2013504 (1997); also in Proc. 25th ACM STOC, pp. 623-631 (1993)","journal-title":"Journal of the ACM"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Awerbuch, B., Azar, Y., Fiat, A., Leonardi, S., Rosen, A.: On-line competitive algorithms for call admission in optical networks. In: Proc. 4th Annual European Symposium on Algorithms, pp. 431\u2013444 (1996)","DOI":"10.1007\/3-540-61680-2_73"},{"key":"29_CR6","unstructured":"Awerbuch, B., Azar, Y., Plotkin, S.: Throughput-competitive online routing. In: 34th IEEE Symposium on Foundations of Computer Science, pp. 32\u201340 (1993)"},{"key":"29_CR7","unstructured":"Awerbuch, B., Bartal, Y., Fiat, A., Ros\u00e9n, A.: Competitive non-preemptive call control. In: Proc. of 5th ACM-SIAM Symposium on Discrete Algorithms, pp. 312\u2013320 (1994)"},{"key":"29_CR8","unstructured":"Awerbuch, B., Gawlick, R., Leighton, T., Rabani, Y.: On-line admission control and circuit routing for high performance computation and communication. In: Proc. 35th IEEE Symp. on Found. of Comp. Science, pp. 412\u2013423 (1994)"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Bartal, Y., Fiat, A., Leonardi, S.: Lower bounds for on-line graph problems with application to on-line circuit and optical routing. In: Proc. 28th ACM Symp. on Theory of Computing, pp. 531\u2013540 (1996)","DOI":"10.1145\/237814.238001"},{"key":"29_CR10","volume-title":"Online Computation and Competitive Analysis","author":"A. Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"29_CR11","volume-title":"Introduction to Algorithms","author":"T.T. Cormen","year":"1990","unstructured":"Cormen, T.T., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"29_CR12","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1006\/jagm.1996.0821","volume":"23","author":"J. Garay","year":"1993","unstructured":"Garay, J., Gopal, I., Kutten, S., Mansour, Y., Yung, M.: Efficient on-line call control algorithms. Journal of Algorithms\u00a023, 180\u2013194 (1993); In: Proc. 2\u2019nd Annual Israel Conference on Theory of Computing and Systems (1993)","journal-title":"Journal of Algorithms"},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/BF02523685","volume":"18","author":"N. Garg","year":"1997","unstructured":"Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-Dual Approximation Algorithms for Integral Flow and Multicut in Trees. ALGORITHMICA\u00a018, 3\u201320 (1997)","journal-title":"ALGORITHMICA"},{"key":"29_CR14","unstructured":"Kleinberg, J., Tardos, E.: Disjoint paths in densely embedded graphs. In: Proc. 36th IEEE Symp. on Found. of Comp. Science, pp. 52\u201361 (1995)"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/BFb0029572","volume-title":"Online Algorithms - The State of the Art","author":"S. Leonardi","year":"1998","unstructured":"Leonardi, S.: On-line network routing. In: Fiat, A., Woeginger, G. (eds.) Online Algorithms - The State of the Art, ch.\u00a011, pp. 242\u2013267. Springer, Heidelberg (1998)"},{"key":"29_CR16","unstructured":"Leonardi, S., Marchetti-Spaccamela, A., Presciutti, A., Ros\u00e9n, A.: On-line randomized call control revisited. In: Proc. 9th ACM-SIAM Symp. on Discrete Algorithms, pp. 323\u2013332 (1998)"},{"key":"29_CR17","unstructured":"Lipton, R.J., Tomkins, A.: Online interval scheduling. In: Proc. of the 5th ACM-SIAM Symposium on Discrete Algorithms, pp. 302\u2013311 (1994)"},{"issue":"4","key":"29_CR18","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.D.: Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica\u00a07(4), 365\u2013374 (1987)","journal-title":"Combinatorica"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69903-3_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,9]],"date-time":"2024-05-09T06:53:36Z","timestamp":1715237616000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-69903-3_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540699002","9783540699033"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69903-3_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}