{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T10:02:53Z","timestamp":1775815373276,"version":"3.50.1"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2012,3,7]],"date-time":"2012-03-07T00:00:00Z","timestamp":1331078400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2012,9]]},"DOI":"10.1007\/s00454-012-9417-5","type":"journal-article","created":{"date-parts":[[2012,3,6]],"date-time":"2012-03-06T15:59:32Z","timestamp":1331049572000},"page":"373-392","source":"Crossref","is-referenced-by-count":83,"title":["Approximation Algorithms for Maximum Independent Set of Pseudo-Disks"],"prefix":"10.1007","volume":"48","author":[{"given":"Timothy M.","family":"Chan","sequence":"first","affiliation":[]},{"given":"Sariel","family":"Har-Peled","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,3,7]]},"reference":[{"key":"9417_CR1","series-title":"Lecture Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/11841036_5","volume-title":"Proc. 14th European Sympos. Algorithms","author":"P. Afshani","year":"2006","unstructured":"Afshani,\u00a0P., Chan, T.M.: Dynamic connectivity for axis-parallel rectangles. In: Proc. 14th European Sympos. Algorithms. Lecture Notes Comput. Sci., vol.\u00a04168, pp.\u00a016\u201327 (2006)"},{"issue":"2","key":"9417_CR2","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/j.comgeo.2005.12.001","volume":"34","author":"P.K. Agarwal","year":"2006","unstructured":"Agarwal, P.K., Mustafa, N.H.: Independent set of intersection graphs of convex objects in 2D. Comput. Geom., Theory Appl. 34(2), 83\u201395 (2006)","journal-title":"Comput. Geom., Theory Appl."},{"key":"9417_CR3","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/PL00009348","volume":"19","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., Aronov,\u00a0B., Chan, T.M., Sharir,\u00a0M.: On levels in arrangements of lines, segments, planes, and triangles. Discrete Comput. Geom. 19, 315\u2013331 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"9417_CR4","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/S0925-7721(98)00028-5","volume":"11","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., van Kreveld,\u00a0M., Suri,\u00a0S.: Label placement by maximum independent set in rectangles. Comput. Geom., Theory Appl. 11, 209\u2013218 (1998)","journal-title":"Comput. Geom., Theory Appl."},{"key":"9417_CR5","series-title":"Contemporary Mathematics","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1090\/conm\/453\/08794","volume-title":"Surveys in Discrete and Computational Geometry Twenty Years Later","author":"P.K. Agarwal","year":"2008","unstructured":"Agarwal, P.K., Pach,\u00a0J., Sharir,\u00a0M.: State of the union\u2014of geometric objects. In: Goodman, J.E., Pach,\u00a0J., Pollack,\u00a0R. (eds.) Surveys in Discrete and Computational Geometry Twenty Years Later. Contemporary Mathematics, vol.\u00a0453, pp.\u00a09\u201348. AMS, Providence (2008)"},{"key":"9417_CR6","doi-asserted-by":"crossref","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon,\u00a0N., Spencer, J.H.: The Probabilistic Method, 2nd edn. Wiley-Interscience, New York (2000)","edition":"2"},{"issue":"5","key":"9417_CR7","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora,\u00a0S.: Polynomial time approximation schemes for Euclidean TSP and other geometric problems. J. Assoc. Comput. Mach. 45(5), 753\u2013782 (1998)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9417_CR8","doi-asserted-by":"crossref","first-page":"181","DOI":"10.7146\/math.scand.a-10607","volume":"8","author":"E. Asplund","year":"1960","unstructured":"Asplund,\u00a0E., Gr\u00fcbaum,\u00a0B.: On a coloring problem. Math. Scand. 8, 181\u2013188 (1960)","journal-title":"Math. Scand."},{"key":"9417_CR9","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1145\/174644.174650","volume":"41","author":"B.S. Baker","year":"1994","unstructured":"Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. Assoc. Comput. Mach. 41, 153\u2013180 (1994)","journal-title":"J. Assoc. Comput. Mach."},{"key":"9417_CR10","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/1041680.1041683","volume":"36","author":"R. Bar-Yehuda","year":"2004","unstructured":"Bar-Yehuda,\u00a0R., Bendel,\u00a0K., Freund,\u00a0A., Rawitz,\u00a0D.: Local ratio: A unified framework for approximation algorithms. In memoriam: Shimon Even 1935\u20132004. ACM Comput. Surv. 36, 422\u2013463 (2004)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"9417_CR11","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s002240000113","volume":"32","author":"P. Berman","year":"1999","unstructured":"Berman,\u00a0P., Fujito,\u00a0T.: On approximation properties of the independent set problem for low degree graphs. Theor. Comput. Sci. 32(2), 115\u2013132 (1999)","journal-title":"Theor. Comput. Sci."},{"key":"9417_CR12","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1006\/jagm.2001.1188","volume":"41","author":"P. Berman","year":"2001","unstructured":"Berman,\u00a0P., DasGupta,\u00a0B., Muthukrishnan,\u00a0S., Ramaswami,\u00a0S.: Efficient approximation algorithms for tiling and packing problems with rectangles. J. Algorithms 41, 443\u2013470 (2001)","journal-title":"J. Algorithms"},{"key":"9417_CR13","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02570718","volume":"14","author":"H. Br\u00f6nnimann","year":"1995","unstructured":"Br\u00f6nnimann,\u00a0H., Goodrich, M.T.: Almost optimal set covers in finite VC-dimension. Discrete Comput. Geom. 14, 263\u2013279 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"9417_CR14","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1137\/1.9781611973068.97","volume-title":"Proc. 20th ACM-SIAM Sympos. Discrete Algorithms","author":"P. Chalermsook","year":"2009","unstructured":"Chalermsook,\u00a0P., Chuzhoy,\u00a0J.: Maximum independent set of rectangles. In: Proc. 20th ACM-SIAM Sympos. Discrete Algorithms, pp.\u00a0892\u2013901 (2009)"},{"issue":"2","key":"9417_CR15","doi-asserted-by":"crossref","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. J. Algorithms 46(2), 178\u2013189 (2003)","journal-title":"J. Algorithms"},{"key":"9417_CR16","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/j.ipl.2003.09.019","volume":"89","author":"T.M. Chan","year":"2004","unstructured":"Chan, T.M.: A note on maximum independent sets in rectangle intersection graphs. Inf. Process. Lett. 89, 19\u201323 (2004)","journal-title":"Inf. Process. Lett."},{"key":"9417_CR17","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1145\/1542362.1542420","volume-title":"Proc. 25th Annu. ACM Sympos. Comput. Geom.","author":"T.M. Chan","year":"2009","unstructured":"Chan, T.M., Har-Peled,\u00a0S.: Approximation algorithms for maximum independent set of pseudo-disks. In: Proc. 25th Annu. ACM Sympos. Comput. Geom., pp.\u00a0333\u2013340 (2009). cs.uiuc.edu\/~sariel\/papers\/08\/w_indep"},{"key":"9417_CR18","doi-asserted-by":"crossref","unstructured":"Chekuri,\u00a0C., Vondr\u00e1k,\u00a0J., Zenklusen,\u00a0R.: Submodular function maximization via the multilinear relaxation and contention resolution schemes. In: Proc. 43rd Annu. ACM Sympos. Theory Comput. (2011, to appear)","DOI":"10.1145\/1993636.1993740"},{"key":"9417_CR19","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","volume":"4","author":"K.L. Clarkson","year":"1989","unstructured":"Clarkson, K.L., Shor, P.W.: Applications of random sampling in computational geometry,\u00a0II. Discrete Comput. Geom. 4, 387\u2013421 (1989)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"9417_CR20","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/s00454-006-1273-8","volume":"37","author":"K.L. Clarkson","year":"2007","unstructured":"Clarkson, K.L., Varadarajan, K.R.: Improved approximation algorithms for geometric set cover. Discrete Comput. Geom. 37(1), 43\u201358 (2007)","journal-title":"Discrete Comput. Geom."},{"key":"9417_CR21","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/S0925-7721(99)00059-0","volume":"15","author":"A. Efrat","year":"2000","unstructured":"Efrat,\u00a0A., Katz, M.J., Nielsen,\u00a0F., Sharir,\u00a0M.: Dynamic data structures for fat objects and their applications. Comput. Geom., Theory Appl. 15, 215\u2013227 (2000)","journal-title":"Comput. Geom., Theory Appl."},{"issue":"6","key":"9417_CR22","doi-asserted-by":"crossref","first-page":"1302","DOI":"10.1137\/S0097539702402676","volume":"34","author":"T. Erlebach","year":"2005","unstructured":"Erlebach,\u00a0T., Jansen,\u00a0K., Seidel,\u00a0E.: Polynomial-time approximation schemes for geometric intersection graphs. SIAM J. Comput. 34(6), 1302\u20131323 (2005)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9417_CR23","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/j.ipl.2005.03.010","volume":"95","author":"G. Even","year":"2005","unstructured":"Even,\u00a0G., Rawitz,\u00a0D., Shahar,\u00a0S.: Hitting sets when the VC-dimension is small. Inf. Process. Lett. 95(2), 358\u2013362 (2005)","journal-title":"Inf. Process. Lett."},{"key":"9417_CR24","doi-asserted-by":"crossref","first-page":"1161","DOI":"10.1137\/1.9781611973082.87","volume-title":"Proc. 22nd ACM-SIAM Sympos. Discrete Algorithms","author":"J. Fox","year":"2011","unstructured":"Fox,\u00a0J., Pach,\u00a0J.: Computing the independence number of intersection graphs. In: Proc. 22nd ACM-SIAM Sympos. Discrete Algorithms, pp.\u00a01161\u20131165 (2011)"},{"issue":"6","key":"9417_CR25","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1137\/0216064","volume":"16","author":"G.N. Frederickson","year":"1987","unstructured":"Frederickson, G.N.: Fast algorithms for shortest paths in planar graphs, with applications. SIAM J. Comput. 16(6), 1004\u20131022 (1987)","journal-title":"SIAM J. Comput."},{"key":"9417_CR26","first-page":"1","volume-title":"The 2nd Intl. Work. Approx. Algs. Combin. Opt. Problems","author":"M.M. Halld\u00f3rsson","year":"1998","unstructured":"Halld\u00f3rsson, M.M.: Approximations of independent sets in graphs. In: The 2nd Intl. Work. Approx. Algs. Combin. Opt. Problems, pp.\u00a01\u201313 (1998)"},{"key":"9417_CR27","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/BF02392825","volume":"182","author":"J. Hastad","year":"1996","unstructured":"Hastad,\u00a0J.: Clique is hard to approximate within n 1\u2212\u03b5 . Acta Math. 182, 105\u2013142 (1996)","journal-title":"Acta Math."},{"key":"9417_CR28","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF02187683","volume":"1","author":"K. Kedem","year":"1986","unstructured":"Kedem,\u00a0K., Livne,\u00a0R., Pach,\u00a0J., Sharir,\u00a0M.: On the union of Jordan regions and collision-free translational motion amidst polygonal obstacles. Discrete Comput. Geom. 1, 59\u201371 (1986)","journal-title":"Discrete Comput. Geom."},{"key":"9417_CR29","first-page":"494","volume-title":"Proc. 48th Annu. IEEE Sympos. Found. Comput. Sci","author":"C. Koufogiannakis","year":"2007","unstructured":"Koufogiannakis,\u00a0C., Young, N.E.: Beating simplex for fractional packing and covering linear programs. In: Proc. 48th Annu. IEEE Sympos. Found. Comput. Sci, pp.\u00a0494\u2013506 (2007)"},{"key":"9417_CR30","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1137\/0136016","volume":"36","author":"R.J. Lipton","year":"1979","unstructured":"Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36, 177\u2013189 (1979)","journal-title":"SIAM J. Appl. Math."},{"key":"9417_CR31","series-title":"Lecture Notes Comput. Sci.","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1007\/3-540-44634-6_4","volume-title":"Proc. 7th Workshop Algorithms Data Struct.","author":"P.M. Long","year":"2001","unstructured":"Long, P.M.: Using the pseudo-dimension to analyze approximation algorithms for integer programming. In: Proc. 7th Workshop Algorithms Data Struct. Lecture Notes Comput. Sci., vol.\u00a02125, pp.\u00a026\u201337 (2001)"},{"key":"9417_CR32","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1002\/net.3230250205","volume":"25","author":"M.V. Marathe","year":"1995","unstructured":"Marathe, M.V., Breu,\u00a0H., Hunt, H.B. III, Ravi, S.S., Rosenkrantz, D.J.: Simple heuristics for unit disk graphs. Networks 25, 59\u201368 (1995)","journal-title":"Networks"},{"issue":"3","key":"9417_CR33","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0925-7721(92)90006-E","volume":"2","author":"J. Matou\u0161ek","year":"1992","unstructured":"Matou\u0161ek,\u00a0J.: Reporting points in halfspaces. Comput. Geom., Theory Appl. 2(3), 169\u2013186 (1992)","journal-title":"Comput. Geom., Theory Appl."},{"key":"9417_CR34","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511814075","volume-title":"Randomized Algorithms","author":"R. Motwani","year":"1995","unstructured":"Motwani,\u00a0R., Raghavan,\u00a0P.: Randomized Algorithms. Cambridge University Press, New York (1995)"},{"key":"9417_CR35","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1145\/1542362.1542367","volume-title":"Proc. 25th Annu. ACM Sympos. Comput. Geom.","author":"N.H. Mustafa","year":"2009","unstructured":"Mustafa, N.H., Ray,\u00a0S.: PTAS for geometric hitting set problems via local search. In: Proc. 25th Annu. ACM Sympos. Comput. Geom., pp.\u00a017\u201322 (2009)"},{"key":"9417_CR36","series-title":"Lecture Notes Comput. Sci.","first-page":"214","volume-title":"Proc. 30th Int. Workshop Graph-Theoretic Concepts in Comput. Sci.","author":"T. Nieberg","year":"2005","unstructured":"Nieberg,\u00a0T., Hurink,\u00a0J., Kern,\u00a0W.: A robust PTAS for maximum weight independent set in unit disk graphs. In: Proc. 30th Int. Workshop Graph-Theoretic Concepts in Comput. Sci. Lecture Notes Comput. Sci., vol.\u00a03353, pp.\u00a0214\u2013221 (2005)"},{"key":"9417_CR37","first-page":"199","volume-title":"Proc. 24th ACM Sympos. Comput. Geom.","author":"E. Pyrga","year":"2008","unstructured":"Pyrga,\u00a0E., Ray,\u00a0S.: New existence proofs for \u03b5-nets. In: Proc. 24th ACM Sympos. Comput. Geom., pp.\u00a0199\u2013207 (2008)"},{"key":"9417_CR38","first-page":"232","volume-title":"Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci.","author":"W.D. Smith","year":"1998","unstructured":"Smith, W.D., Wormald, N.C.: Geometric separator theorems and applications. In: Proc. 39th Annu. IEEE Sympos. Found. Comput. Sci., pp.\u00a0232\u2013243 (1998)"},{"key":"9417_CR39","first-page":"641","volume-title":"Proc. 42nd Annu. ACM Sympos. Theory Comput.","author":"K. Varadarajan","year":"2010","unstructured":"Varadarajan,\u00a0K.: Weighted geometric set cover via quasi-uniform sampling. In: Proc. 42nd Annu. ACM Sympos. Theory Comput., pp.\u00a0641\u2013648 (2010)"},{"key":"9417_CR40","unstructured":"Whitesides,\u00a0S., Zhao,\u00a0R.: k-admissible collections of Jordan curves and offsets of circular arc figures. Technical Report SOCS 90.08, McGill Univ., Montreal, Quebec (1990)"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9417-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-012-9417-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-012-9417-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,25]],"date-time":"2019-06-25T01:09:28Z","timestamp":1561424968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-012-9417-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,3,7]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,9]]}},"alternative-id":["9417"],"URL":"https:\/\/doi.org\/10.1007\/s00454-012-9417-5","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,3,7]]}}}