{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,23]],"date-time":"2026-08-23T15:24:57Z","timestamp":1787498697785,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642033667","type":"print"},{"value":"9783642033674","type":"electronic"}],"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-03367-4_39","type":"book-chapter","created":{"date-parts":[[2009,7,20]],"date-time":"2009-07-20T03:56:42Z","timestamp":1248062202000},"page":"447-458","source":"Crossref","is-referenced-by-count":3,"title":["A Scheme for Computing Minimum Covers within Simple Regions"],"prefix":"10.1007","author":[{"given":"Matthew J.","family":"Katz","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gila","family":"Morgenstern","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"39_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: Proc. 22nd Sympos. Comput. Geom., pp. 449\u2013458 (2006)","DOI":"10.1145\/1137856.1137922"},{"key":"39_CR2","doi-asserted-by":"publisher","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.\u00a014, 463\u2013479 (1995)","journal-title":"Discrete & Comput. Geom."},{"issue":"2","key":"39_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\u00a09(2), 101\u2013111 (2004)","journal-title":"MONET"},{"key":"39_CR4","doi-asserted-by":"crossref","unstructured":"Carmi, P., Katz, M.J., Lev-Tov, N.: Covering points by unit disks of fixed location. In: Proc. 18th Int. Sympos. on Algorithms and Computation, pp. 644\u2013655 (2007)","DOI":"10.1007\/978-3-540-77120-3_56"},{"key":"39_CR5","doi-asserted-by":"crossref","unstructured":"Chew, L.P., Drysdale, R.L.: Voronoi diagrams based on convex distance functions. In: Proc. 1st Sympos. Comput. Geom., pp. 235\u2013244 (1985)","DOI":"10.1145\/323233.323264"},{"issue":"3","key":"39_CR6","doi-asserted-by":"publisher","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.\u00a021(3), 405\u2013420 (1999)","journal-title":"Discrete & Comput. Geom."},{"key":"39_CR7","doi-asserted-by":"publisher","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. on Computing\u00a01, 180\u2013187 (1972)","journal-title":"SIAM J. on Computing"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, 1st edn. Academic Press, New York (1980); 2nd edn. Annals of Discrete Mathematics 57, Elsevier, Amsterdam (2004)","DOI":"10.1016\/B978-0-12-289260-8.50008-X"},{"key":"39_CR9","series-title":"Annals of Discrete Mathematics","doi-asserted-by":"publisher","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. 325\u2013356. North-Holland, Amsterdam (1984)"},{"key":"39_CR10","unstructured":"Halperin, D., Linhart, C.: The minimum enclosing disk with obstacles (manuscript) (1999)"},{"key":"39_CR11","doi-asserted-by":"publisher","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\u00a042, 109\u2013134 (2002)","journal-title":"J. Algorithms"},{"key":"39_CR12","doi-asserted-by":"publisher","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\u00a032, 130\u2013136 (1985)","journal-title":"J. ACM"},{"key":"39_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. Studies in Locational Analysis\u00a015, 17\u201335 (2000)","journal-title":"Studies in Locational Analysis"},{"issue":"2","key":"39_CR14","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1145\/322123.322124","volume":"26","author":"F.K. Hwang","year":"1979","unstructured":"Hwang, F.K.: An O(n logn) algorithm for rectilinear minimal spanning trees. J. ACM\u00a026(2), 177\u2013182 (1979)","journal-title":"J. ACM"},{"key":"39_CR15","doi-asserted-by":"publisher","first-page":"182","DOI":"10.1016\/0196-6774(82)90018-9","volume":"3","author":"D.S. Johnson","year":"1982","unstructured":"Johnson, D.S.: The NP-completeness column: An ongoing guide. J. Algorithms\u00a03, 182\u2013195 (1982)","journal-title":"J. Algorithms"},{"key":"39_CR16","unstructured":"Katz, M.J., Morgenstern, G.: Guarding orthogonal art galleries with sliding cameras. In: Proc. 25th European Workshop on Comput. Geom., pp. 159\u2013162 (2009)"},{"issue":"3","key":"39_CR17","doi-asserted-by":"publisher","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.\u00a039(3), 219\u2013228 (2008)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"4","key":"39_CR18","doi-asserted-by":"publisher","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\u00a027(4), 604\u2013618 (1980)","journal-title":"J. ACM"},{"issue":"1","key":"39_CR19","doi-asserted-by":"publisher","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 \u2009\u221e\u2009) Metrics with 2-dimensional storage applications. SIAM J. on Computing\u00a09(1), 200\u2013211 (1980)","journal-title":"SIAM J. on Computing"},{"key":"39_CR20","doi-asserted-by":"publisher","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. of Computer and System Sciences\u00a040, 19\u201348 (1990)","journal-title":"J. of Computer and System Sciences"},{"issue":"3","key":"39_CR21","doi-asserted-by":"publisher","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. on Discrete Math.\u00a02(3), 371\u2013392 (1989)","journal-title":"SIAM J. on Discrete Math."},{"key":"39_CR22","unstructured":"Narayanappa, S., Vojtechovsky, P.: An improved approximation factor for the unit disk covering problem. In: Proc. 18th Canadian Conf. Comput. Geom., pp. 15\u201318 (2006)"},{"issue":"2","key":"39_CR23","doi-asserted-by":"publisher","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.\u00a017(2), 105\u2013138 (2007)","journal-title":"Int. J. Comput. Geom. Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03367-4_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T11:28:46Z","timestamp":1558438126000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03367-4_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642033667","9783642033674"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03367-4_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}