{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,5]],"date-time":"2025-08-05T12:47:29Z","timestamp":1754398049994},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540921813"},{"type":"electronic","value":"9783540921820"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-92182-0_7","type":"book-chapter","created":{"date-parts":[[2008,12,10]],"date-time":"2008-12-10T02:38:06Z","timestamp":1228876686000},"page":"40-51","source":"Crossref","is-referenced-by-count":3,"title":["Multiobjective Disk Cover Admits a PTAS"],"prefix":"10.1007","author":[{"given":"Christian","family":"Gla\u00dfer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Reitwie\u00dfner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heinz","family":"Schmitz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"crossref","unstructured":"Alt, H., Arkin, E.M., Br\u00f6nnimann, H., Erickson, J., Fekete, S.P., Knauer, C., Lenchner, J., Mitchell, J.S.B., Whittlesey, K.: Minimum-cost coverage of point sets by disks. In: Symposium on Computational Geometry, pp. 449\u2013458 (2006)","DOI":"10.1145\/1137856.1137922"},{"key":"7_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1007\/3-540-44676-1_16","volume-title":"Algorithms - ESA 2001","author":"E. Angel","year":"2001","unstructured":"Angel, E., Bampis, E., Kononov, A.: A FPTAS for approximating the unrelated parallel machines scheduling problem with costs. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 194\u2013205. Springer, Heidelberg (2001)"},{"issue":"1-3","key":"7_CR3","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/S0304-3975(03)00288-3","volume":"306","author":"E. Angel","year":"2003","unstructured":"Angel, E., Bampis, E., Kononov, A.: On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems. Theoretical Computer Science\u00a0306(1-3), 319\u2013338 (2003)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"7_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/s10707-006-0017-5","volume":"12","author":"B. Ben-Moshe","year":"2008","unstructured":"Ben-Moshe, B., Carmi, P., Katz, M.J.: Approximating the visible region of a point on a terrain. GeoInformatica\u00a012(1), 21\u201336 (2008)","journal-title":"GeoInformatica"},{"issue":"2","key":"7_CR5","first-page":"101","volume":"9","author":"G. Calinescu","year":"2004","unstructured":"Calinescu, G., Mandoiu, I.I., Wan, P.-J., Zelikovsky, A.: Selecting forwarding neighbors in wireless ad hoc networks. MONET\u00a09(2), 101\u2013111 (2004)","journal-title":"MONET"},{"issue":"3-4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1023\/B:AMAI.0000012867.03976.a5","volume":"40","author":"A.H. Cannon","year":"2004","unstructured":"Cannon, A.H., Cowen, L.J.: Approximation algorithms for the class cover problem. Annals of Mathematics and Artificial Intelligence\u00a040(3-4), 215\u2013223 (2004)","journal-title":"Annals of Mathematics and Artificial Intelligence"},{"key":"7_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"644","DOI":"10.1007\/978-3-540-77120-3_56","volume-title":"Algorithms and Computation","author":"P. Carmi","year":"2007","unstructured":"Carmi, P., Katz, M.J., Lev-Tov, N.: Covering points by unit disks of fixed location. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol.\u00a04835, pp. 644\u2013655. Springer, Heidelberg (2007)"},{"issue":"2","key":"7_CR8","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/S0196-6774(02)00294-8","volume":"46","author":"T.M. Chan","year":"2003","unstructured":"Chan, T.M.: Polynomial-time approximation schemes for packing and piercing fat objects. Journal of Algorithms\u00a046(2), 178\u2013189 (2003)","journal-title":"Journal of Algorithms"},{"issue":"2","key":"7_CR9","doi-asserted-by":"publisher","first-page":"617","DOI":"10.1137\/S1052623495288192","volume":"8","author":"T.C.E. Cheng","year":"1998","unstructured":"Cheng, T.C.E., Janiak, A., Kovalyov, M.Y.: Bicriterion single machine scheduling with resource dependent processing times. SIAM Journal on Optimization\u00a08(2), 617\u2013630 (1998)","journal-title":"SIAM Journal on Optimization"},{"issue":"1-3","key":"7_CR10","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0012-365X(90)90358-O","volume":"86","author":"B.N. Clark","year":"1990","unstructured":"Clark, B.N., Colbourn, C.J., Johnson, D.S.: Unit disk graphs. Discrete Mathematics\u00a086(1-3), 165\u2013177 (1990)","journal-title":"Discrete Mathematics"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/978-3-540-74208-1_6","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"I. Diakonikolas","year":"2007","unstructured":"Diakonikolas, I., Yannakakis, M.: Small approximate pareto sets for bi-objective shortest paths and other problems. In: Charikar, M., Jansen, K., Reingold, O., Rolim, J.D.P. (eds.) RANDOM 2007 and APPROX 2007. LNCS, vol.\u00a04627, pp. 74\u201388. Springer, Heidelberg (2007)"},{"key":"7_CR12","first-page":"280","volume-title":"Proceedings 19th Annual ACM Symposium on Parallel Algorithms and Architectures","author":"J. Dongarra","year":"2007","unstructured":"Dongarra, J., Jeannot, E., Saule, E., Shi, Z.: Bi-objective scheduling algorithms for optimizing makespan and reliability on heterogeneous systems. In: Proceedings 19th Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 280\u2013288. ACM, New York (2007)"},{"key":"7_CR13","volume-title":"Multicriteria Optimization","author":"M. Ehrgott","year":"2005","unstructured":"Ehrgott, M.: Multicriteria Optimization. Springer, Heidelberg (2005)"},{"issue":"6","key":"7_CR14","doi-asserted-by":"publisher","first-page":"1302","DOI":"10.1137\/S0097539702402676","volume":"34","author":"T. Erlebach","year":"2005","unstructured":"Erlebach, T., Jansen, K., Seidel, E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM Journal on Computing\u00a034(6), 1302\u20131323 (2005)","journal-title":"SIAM Journal on Computing"},{"key":"7_CR15","unstructured":"Erlebach, T., van Leeuwen, E.J.: Approximating geometric coverage problems. In: Proceedings of 19th Annual Aymposium on Discrete Algorithms, pp. 1267\u20131276 (2008)"},{"issue":"1","key":"7_CR16","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.jalgor.2004.04.002","volume":"53","author":"R. Gandhi","year":"2004","unstructured":"Gandhi, R., Khuller, S., Srinivasan, A.: Approximation algorithms for partial covering problems. J. Algorithms\u00a053(1), 55\u201384 (2004)","journal-title":"J. Algorithms"},{"issue":"1","key":"7_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dam.2004.07.005","volume":"148","author":"C. Gla\u00dfer","year":"2005","unstructured":"Gla\u00dfer, C., Reith, S., Vollmer, H.: The complexity of base station positioning in cellular networks. Discrete Applied Mathematics\u00a0148(1), 1\u201312 (2005)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR18","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D. Hochbaum","year":"1985","unstructured":"Hochbaum, D., Maass, W.: Approximation schemes for covering and packing problems in image processing and VLSI. Journal of the ACM\u00a032, 130\u2013136 (1985)","journal-title":"Journal of the ACM"},{"key":"7_CR19","unstructured":"Narayanappa, S., Vojtechovsky, P.: An improved approximation factor for the unit disk covering problem. In: CCCG (2006)"},{"key":"7_CR20","doi-asserted-by":"crossref","unstructured":"Papadimitriou, C.H., Yannakakis, M.: On the approximability of trade-offs and optimal access of web sources. In: FOCS, pp. 86\u201392 (2000)","DOI":"10.1109\/SFCS.2000.892068"},{"key":"7_CR21","unstructured":"Safer, H.M., Orlin, J.B.: Fast approximation schemes for multi-criteria combinatorial optimization. Working papers 3756-95, Massachusetts Institute of Technology, Sloan School of Management (1995)"},{"key":"7_CR22","unstructured":"Safer, H.M., Orlin, J.B.: Fast approximation schemes for multi-criteria flow, knapsack, and scheduling problems. Working papers 3757-95, Massachusetts Institute of Technology, Sloan School of Management (1995)"},{"issue":"2-3","key":"7_CR23","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.tcs.2005.09.022","volume":"348","author":"S. Vassilvitskii","year":"2005","unstructured":"Vassilvitskii, S., Yannakakis, M.: Efficiently computing succinct trade-off curves. Theoretical Computer Science\u00a0348(2-3), 334\u2013356 (2005)","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-92182-0_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,4]],"date-time":"2019-03-04T10:18:29Z","timestamp":1551694709000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-92182-0_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540921813","9783540921820"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-92182-0_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}