{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:01:32Z","timestamp":1725534092414},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642022692"},{"type":"electronic","value":"9783642022708"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-02270-8_32","type":"book-chapter","created":{"date-parts":[[2009,6,19]],"date-time":"2009-06-19T01:17:47Z","timestamp":1245374267000},"page":"314-325","source":"Crossref","is-referenced-by-count":0,"title":["A Novel Approximate Algorithm for Admission Control"],"prefix":"10.1007","author":[{"given":"Jinghui","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Junzhou","family":"Luo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiang","family":"Wu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"32_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-540-31833-0_18","volume-title":"Approximation and Online Algorithms","author":"U. Adamy","year":"2005","unstructured":"Adamy, U., Erlebach, T., Mitsche, D., Schurr, I., Speckmann, B., Welzl, E.: Off-line admission control for advance reservations in star networks. In: Persiano, G., Solis-Oba, R. (eds.) WAOA 2004. LNCS, vol.\u00a03351, pp. 211\u2013224. Springer, Heidelberg (2005)"},{"issue":"5","key":"32_CR2","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(S.), Schieber, B.: A unified approach to approximating resource allocation and scheduling. J. ACM\u00a048(5), 1069\u20131090 (2001)","journal-title":"J. ACM"},{"issue":"4","key":"32_CR3","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/1041680.1041683","volume":"36","author":"R. Bar-Yehuda","year":"2004","unstructured":"Bar-Yehuda, R., Bendel, K., Freund, A., Rawitz, D.: Local ratio: A unified framework for approximation algorithms in memoriam: Shimon even 1935-2004. ACM Comput. Surv.\u00a036(4), 422\u2013463 (2004)","journal-title":"ACM Comput. Surv."},{"issue":"6","key":"32_CR4","doi-asserted-by":"publisher","first-page":"810","DOI":"10.1006\/jpdc.2000.1714","volume":"61","author":"T.D. Braun","year":"2001","unstructured":"Braun, T.D., Siegel, H.J., Beck, N., B\u00f6l\u00f6ni, L., Maheswaran, M., Reuther, A.I., Robertson, J.P., Theys, M.D., Yao, B., Hensgen, D.A., Freund, R.F.: A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. J. Parallel Distrib. Comput.\u00a061(6), 810\u2013837 (2001)","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"32_CR5","doi-asserted-by":"publisher","first-page":"162","DOI":"10.1016\/j.ipl.2006.06.003","volume":"100","author":"R. Cohen","year":"2006","unstructured":"Cohen, R., Katzir, L., Raz, D.: An efficient approximation for the generalized assignment problem. Inf. Process. Lett.\u00a0100(4), 162\u2013166 (2006)","journal-title":"Inf. Process. Lett."},{"key":"32_CR6","doi-asserted-by":"crossref","unstructured":"Guerin, R.A., Orda, A.: Networks with advance reservations: the routing perspective. In: INFOCOM 2000, vol.\u00a01, pp. 118\u2013127 (2000)","DOI":"10.1109\/INFCOM.2000.832180"},{"issue":"2","key":"32_CR7","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/j.ejor.2006.01.049","volume":"178","author":"M.Y. Kovalyov","year":"2007","unstructured":"Kovalyov, M.Y., Ng, C.T., Cheng, T.C.E.: Fixed interval scheduling: Models, applications, computational complexity and algorithms. European Journal of Operational Research\u00a0178(2), 331\u2013342 (2007)","journal-title":"European Journal of Operational Research"},{"key":"32_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/3-540-45753-4_19","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"L. Lewin-Eytan","year":"2002","unstructured":"Lewin-Eytan, L., Naor, J(S.), Orda, A.: Routing and admission control in networks with advance reservations. In: Jansen, K., Leonardi, S., Vazirani, V.V. (eds.) APPROX 2002. LNCS, vol.\u00a02462, pp. 215\u2013228. Springer, Heidelberg (2002)"},{"key":"32_CR9","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1006\/jpdc.1999.1581","volume":"59","author":"M. Maheswaran","year":"1999","unstructured":"Maheswaran, M., Ali, S., Siegel, H.J., Hensgen, D., Freund, R.F.: Dynamic mapping of a class of independent tasks onto heterogeneous computing systems. Journal of Parallel and Distributed Computing\u00a059, 107\u2013131 (1999)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"32_CR10","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/j.jda.2006.10.008","volume":"5","author":"D. Rawitz","year":"2007","unstructured":"Rawitz, D.: Admission control with advance reservations in simple networks. Journal of Discrete Algorithms\u00a05, 491\u2013500 (2007)","journal-title":"Journal of Discrete Algorithms"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Wischik, D., Greenberg, A.: Admission control for booking ahead shared resources. In: INFOCOM 1998, vol.\u00a02, pp. 873\u2013882 (1998)","DOI":"10.1109\/INFCOM.1998.665112"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-02270-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,8]],"date-time":"2019-03-08T16:36:06Z","timestamp":1552062966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02270-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642022692","9783642022708"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02270-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}