{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T17:49:59Z","timestamp":1648662599723},"reference-count":23,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2010,10,14]],"date-time":"2010-10-14T00:00:00Z","timestamp":1287014400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,2]]},"DOI":"10.1007\/s00453-010-9458-1","type":"journal-article","created":{"date-parts":[[2010,10,14]],"date-time":"2010-10-14T07:04:47Z","timestamp":1287039887000},"page":"349-360","source":"Crossref","is-referenced-by-count":0,"title":["A Scheme for Computing Minimum Covers within\u00a0Simple Regions"],"prefix":"10.1007","volume":"62","author":[{"given":"Matthew J.","family":"Katz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gila","family":"Morgenstern","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,10,14]]},"reference":[{"key":"9458_CR1","first-page":"449","volume-title":"Proc. 22nd Sympos. Comput. Geom.","author":"H. Alt","year":"2006","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: Proc. 22nd Sympos. Comput. Geom., pp.\u00a0449\u2013458 (2006)"},{"key":"9458_CR2","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/BF02570718","volume":"14","author":"H. Br\u00f6nnimann","year":"1995","unstructured":"Br\u00f6nnimann, H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14, 463\u2013479 (1995)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"9458_CR3","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 9(2), 101\u2013111 (2004)","journal-title":"Monet"},{"key":"9458_CR4","doi-asserted-by":"crossref","first-page":"644","DOI":"10.1007\/978-3-540-77120-3_56","volume-title":"Proc. 18th Internat. Sympos. on 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: Proc. 18th Internat. Sympos. on Algorithms and Computation, pp.\u00a0644\u2013655 (2007)"},{"key":"9458_CR5","first-page":"235","volume-title":"Proc. 1st Sympos. Comput. Geom.","author":"L.P. Chew","year":"1985","unstructured":"Chew, L.P., Drysdale, R.L.: Voronoi diagrams based on convex distance functions. In: Proc. 1st Sympos. Comput. Geom., pp.\u00a0235\u2013244 (1985)"},{"issue":"3","key":"9458_CR6","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1007\/PL00009429","volume":"21","author":"F. Chin","year":"1999","unstructured":"Chin, F., Snoeyink, J., Wang, C.A.: Finding the medial axis of a simple polygon in linear time. Discrete Comput. Geom. 21(3), 405\u2013420 (1999)","journal-title":"Discrete Comput. Geom."},{"key":"9458_CR7","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1137\/0201013","volume":"1","author":"F. Gavril","year":"1972","unstructured":"Gavril, F.: Algorithms for minimum coloring, maximum clique, minimum covering by cliques, and maximum independent set of a chordal graph. SIAM J. Comput. 1, 180\u2013187 (1972)","journal-title":"SIAM J. Comput."},{"key":"9458_CR8","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"M.C. Golumbic","year":"1980","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 1st edn. Academic Press, New York (1980); 2nd edn.: Annals of Discrete Mathematics, vol.\u00a057. Elsevier (2004)","edition":"1"},{"key":"9458_CR9","series-title":"Annals of Discrete Mathematics","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1016\/S0304-0208(08)72943-8","volume-title":"Topics on Perfect Graphs","author":"M. Gr\u00f6tschel","year":"1984","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Polynomial algorithms for Perfect Graphs. In: Berge, C., Chv\u00e1tal, V. (eds.) Topics on Perfect Graphs. Annals of Discrete Mathematics, vol.\u00a021, pp.\u00a0325\u2013356. North-Holland, Amsterdam (1984)"},{"key":"9458_CR10","unstructured":"Halperin, D., Linhart, C.: The minimum enclosing disk with obstacles. Manuscript (1999)"},{"key":"9458_CR11","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1006\/jagm.2001.1194","volume":"42","author":"D. Halperin","year":"2002","unstructured":"Halperin, D., Sharir, M., Goldberg, K.: The 2-center problem with obstacles. J. Algorithms 42, 109\u2013134 (2002)","journal-title":"J. Algorithms"},{"key":"9458_CR12","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1145\/2455.214106","volume":"32","author":"D.S. Hochbaum","year":"1985","unstructured":"Hochbaum, D.S., Maas, W.: Approximation schemes for covering and packing problems in image processing and VLSI. J. ACM 32, 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"9458_CR13","first-page":"17","volume":"15","author":"F. Hurtado","year":"2000","unstructured":"Hurtado, F., Sacrist\u00e1n, V., Toussaint, G.: Some constrained minimax and maximin location problems. Stud. Locat. Anal. 15, 17\u201335 (2000)","journal-title":"Stud. Locat. Anal."},{"issue":"2","key":"9458_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/322123.322124","volume":"26","author":"F.K. Hwang","year":"1979","unstructured":"Hwang, F.K.: An O(nlog\u2009n) algorithm for rectilinear minimal spanning trees. J. ACM 26(2), 177\u2013182 (1979)","journal-title":"J. ACM"},{"key":"9458_CR15","first-page":"159","volume-title":"Proc. 25th European Workshop on Comput. Geom.","author":"M.J. Katz","year":"2009","unstructured":"Katz, M.J., Morgenstern, G.: Guarding orthogonal art galleries with sliding cameras. In: Proc. 25th European Workshop on Comput. Geom., pp.\u00a0159\u2013162 (2009)"},{"issue":"3","key":"9458_CR16","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/j.comgeo.2007.02.002","volume":"39","author":"M.J. Katz","year":"2008","unstructured":"Katz, M.J., Roisman, G.S.: On guarding the vertices of rectilinear domains. Comput. Geom. Theory Appl. 39(3), 219\u2013228 (2008)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"9458_CR17","doi-asserted-by":"crossref","first-page":"604","DOI":"10.1145\/322217.322219","volume":"27","author":"D.T. Lee","year":"1980","unstructured":"Lee, D.T.: Two-dimensional Voronoi diagrams in the L p -metric. J. ACM 27(4), 604\u2013618 (1980)","journal-title":"J. ACM"},{"issue":"1","key":"9458_CR18","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1137\/0209017","volume":"9","author":"D.T. Lee","year":"1980","unstructured":"Lee, D.T., Wong, C.K.: Voronoi diagrams in L 1 (L \u221e) Metrics with 2-dimensional storage applications. SIAM J. Comput. 9(1), 200\u2013211 (1980)","journal-title":"SIAM J. Comput."},{"key":"9458_CR19","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0022-0000(90)90017-F","volume":"40","author":"R. Motwani","year":"1990","unstructured":"Motwani, R., Raghunathan, A., Saran, H.: Covering orthogonal polygons with star polygons: the perfect graph approach. J. Comput. Syst. Sci. 40, 19\u201348 (1990)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9458_CR20","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1137\/0402033","volume":"2","author":"R. Motwani","year":"1989","unstructured":"Motwani, R., Raghunathan, A., Saran, H.: Perfect graphs and orthogonally convex covers. SIAM J. Discrete Math. 2(3), 371\u2013392 (1989)","journal-title":"SIAM J. Discrete Math."},{"key":"9458_CR21","first-page":"17","volume-title":"Proc. 25th Sympos. Comput. Geom.","author":"N.H. Mustafa","year":"2009","unstructured":"Mustafa, N.H., Ray, P.S.: PTAS for geometric hitting set problems via local search. In: Proc. 25th Sympos. Comput. Geom., pp.\u00a017\u201322 (2009)"},{"key":"9458_CR22","first-page":"15","volume-title":"Proc. 18th Canadian Conf. Comput. Geom.","author":"S. Narayanappa","year":"2006","unstructured":"Narayanappa, S., Vojtechovsky, P.: An improved approximation factor for the unit disk covering problem. In: Proc. 18th Canadian Conf. Comput. Geom., pp.\u00a015\u201318 (2006)"},{"issue":"2","key":"9458_CR23","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1142\/S0218195907002264","volume":"17","author":"C. Worman","year":"2007","unstructured":"Worman, C., Keil, J.M.: Polygon decomposition and the orthogonal art gallery problem. Int. J. Comput. Geom. Appl. 17(2), 105\u2013138 (2007)","journal-title":"Int. J. Comput. Geom. Appl."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9458-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-010-9458-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-010-9458-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T13:45:06Z","timestamp":1559137506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-010-9458-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,10,14]]},"references-count":23,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,2]]}},"alternative-id":["9458"],"URL":"https:\/\/doi.org\/10.1007\/s00453-010-9458-1","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,10,14]]}}}