{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:25:38Z","timestamp":1725470738092},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540388753"},{"type":"electronic","value":"9783540388760"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11841036_9","type":"book-chapter","created":{"date-parts":[[2006,9,11]],"date-time":"2006-09-11T13:20:54Z","timestamp":1157980854000},"page":"64-75","source":"Crossref","is-referenced-by-count":6,"title":["Resource Allocation in Bounded Degree Trees"],"prefix":"10.1007","author":[{"given":"Reuven","family":"Bar-Yehuda","sequence":"first","affiliation":[]},{"given":"Michael","family":"Beder","sequence":"additional","affiliation":[]},{"given":"Yuval","family":"Cohen","sequence":"additional","affiliation":[]},{"given":"Dror","family":"Rawitz","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"9_CR1","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Academic Press, London (1980)"},{"key":"9_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0012-365X(85)90051-2","volume":"55","author":"R.E. Tarjan","year":"1985","unstructured":"Tarjan, R.E.: Decomposition by clique separators. Discrete Mathematics\u00a055, 221\u2013232 (1985)","journal-title":"Discrete Mathematics"},{"key":"9_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0166-218X(87)90037-0","volume":"18","author":"E.M. Arkin","year":"1987","unstructured":"Arkin, E.M., Silverberg, E.B.: Scheduling jobs with fixed start and end times. Discrete Applied Mathematics\u00a018, 1\u20138 (1987)","journal-title":"Discrete Applied Mathematics"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"1806","DOI":"10.1137\/S0097539797321237","volume":"28","author":"A. Bar-Noy","year":"1999","unstructured":"Bar-Noy, A., Canetti, R., Kutten, S., Mansour, Y., Schieber, B.: Bandwidth allocation with preemption. SIAM J. Comp.\u00a028, 1806\u20131828 (1999)","journal-title":"SIAM J. Comp."},{"key":"9_CR5","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1002\/1099-1425(200011\/12)3:6<365::AID-JOS56>3.0.CO;2-P","volume":"3","author":"C. Phillips","year":"2000","unstructured":"Phillips, C., Uma, R.N., Wein, J.: Off-line admission control for general scheduling problems. Journal of Scheduling\u00a03, 365\u2013381 (2000)","journal-title":"Journal of Scheduling"},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1007\/3-540-44450-5_33","volume-title":"FST TCS 2000: Foundations of Software Technology and Theoretical Science","author":"S. Leonardi","year":"2000","unstructured":"Leonardi, S., Marchetti-Spaccamela, A., Vitaletti, A.: Approximation algorithms for bandwidth and storage allocation problems under real time constraints. In: Kapoor, S., Prasad, S. (eds.) FST TCS 2000. LNCS, vol.\u00a01974, pp. 409\u2013420. Springer, Heidelberg (2000)"},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"1069","DOI":"10.1145\/502102.502107","volume":"48","author":"A. Bar-Noy","year":"2001","unstructured":"Bar-Noy, A., Bar-Yehuda, R., Freund, A., Naor, J., Shieber, B.: A unified approach to approximating resource allocation and schedualing. J. ACM\u00a048, 1069\u20131090 (2001)","journal-title":"J. ACM"},{"key":"9_CR8","first-page":"501","volume":"34","author":"B. Chen","year":"2002","unstructured":"Chen, B., Hassin, R., Tzur, M.: Allocation of bandwidth and storage. IIE Transactions\u00a034, 501\u2013507 (2002)","journal-title":"IIE Transactions"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/3-540-47867-1_28","volume-title":"Integer Programming and Combinatorial Optimization","author":"G. Calinescu","year":"2002","unstructured":"Calinescu, G., Chakrabarti, A., Karloff, H.J., Rabani, Y.: Improved approximation algorithms for resource allocation. In: Cook, W.J., Schulz, A.S. (eds.) IPCO 2002. LNCS, vol.\u00a02337, pp. 401\u2013414. Springer, Heidelberg (2002)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/3-540-45753-4_7","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"A. Chakrabarti","year":"2002","unstructured":"Chakrabarti, A., Chekuri, C., Gupta, A., Kumar, A.: Approximation algorithms for the unsplittable flow problem. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 51\u201366. Springer, Heidelberg (2002)"},{"key":"9_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1007\/3-540-45061-0_34","volume-title":"Automata, Languages and Programming","author":"C. Chekuri","year":"2003","unstructured":"Chekuri, C., Mydlarz, M., Shepherd, B.: Multicommodity demand flow in a tree. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol.\u00a02719, pp. 410\u2013425. Springer, Heidelberg (2003)"},{"key":"9_CR12","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00453-004-1114-1","volume":"40","author":"L. Lewin-Eytan","year":"2004","unstructured":"Lewin-Eytan, L., Naor, J., Orda, A.: Admission control in networks with advance reservations. Algorithmica\u00a040, 293\u2013403 (2004)","journal-title":"Algorithmica"},{"key":"9_CR13","doi-asserted-by":"publisher","first-page":"632","DOI":"10.1137\/S0097539703423941","volume":"33","author":"A.L. Buchsbaum","year":"2004","unstructured":"Buchsbaum, A.L., Karloff, H., Kenyon, C., Reingold, N., Thorup, M.: OPT versus LOAD in dynamic storage allocation. SIAM J. Comp.\u00a033, 632\u2013646 (2004)","journal-title":"SIAM J. Comp."},{"key":"9_CR14","first-page":"27","volume":"25","author":"R. Bar-Yehuda","year":"1985","unstructured":"Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics\u00a025, 27\u201346 (1985)","journal-title":"Annals of Discrete Mathematics"},{"key":"9_CR15","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1137\/S0895480196305124","volume":"12","author":"V. Bafna","year":"1999","unstructured":"Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Disc. Math.\u00a012, 289\u2013297 (1999)","journal-title":"SIAM J. Disc. Math."},{"key":"9_CR16","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s004530010009","volume":"27","author":"R. Bar-Yehuda","year":"2000","unstructured":"Bar-Yehuda, R.: One for the price of two: A unified approach for approximating covering problems. Algorithmica\u00a027, 131\u2013144 (2000)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11841036_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:17:02Z","timestamp":1619507822000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11841036_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540388753","9783540388760"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11841036_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}