{"id":"https://openalex.org/W2604794478","doi":"https://doi.org/10.1145/3326122","title":"Approximation Schemes for Independent Set and Sparse Subsets of Polygons","display_name":"Approximation Schemes for Independent Set and Sparse Subsets of Polygons","publication_year":2019,"publication_date":"2019-06-17","ids":{"openalex":"https://openalex.org/W2604794478","doi":"https://doi.org/10.1145/3326122","mag":"2604794478"},"language":"en","primary_location":{"id":"doi:10.1145/3326122","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3326122","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3326122","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3326122","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5050123676","display_name":"Anna Adamaszek","orcid":"https://orcid.org/0000-0003-3291-0124"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Anna Adamaszek","raw_affiliation_strings":["University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040577923","display_name":"Sariel Har-Peled","orcid":"https://orcid.org/0000-0003-2638-9635"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sariel Har-Peled","raw_affiliation_strings":["University of Illinois Urbana-Champaign"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Illinois Urbana-Champaign","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067503013","display_name":"Andreas Wiese","orcid":"https://orcid.org/0000-0003-3705-016X"},"institutions":[{"id":"https://openalex.org/I69737025","display_name":"University of Chile","ror":"https://ror.org/047gc3g35","country_code":"CL","type":"education","lineage":["https://openalex.org/I69737025"]}],"countries":["CL"],"is_corresponding":false,"raw_author_name":"Andreas Wiese","raw_affiliation_strings":["Universidad de Chile, Santiago Centro, Chile"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidad de Chile, Santiago Centro, Chile","institution_ids":["https://openalex.org/I69737025"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.7511,"has_fulltext":true,"cited_by_count":15,"citation_normalized_percentile":{"value":0.94144144,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"66","issue":"4","first_page":"1","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12923","display_name":"Digital Image Processing Techniques","score":0.9936000108718872,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7030790448188782},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6874277591705322},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.6376792788505554},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5961381196975708},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5783877372741699},{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.5569446682929993},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.5417954921722412},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.45739588141441345},{"id":"https://openalex.org/keywords/intersection-graph","display_name":"Intersection graph","score":0.4320959448814392},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41499772667884827},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3487592935562134},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3235422372817993},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.18036028742790222},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.12900346517562866}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7030790448188782},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6874277591705322},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.6376792788505554},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5961381196975708},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5783877372741699},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.5569446682929993},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.5417954921722412},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.45739588141441345},{"id":"https://openalex.org/C54540088","wikidata":"https://www.wikidata.org/wiki/Q3498041","display_name":"Intersection graph","level":4,"score":0.4320959448814392},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41499772667884827},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3487592935562134},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3235422372817993},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.18036028742790222},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.12900346517562866},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1145/3326122","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3326122","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3326122","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:research.vu.nl:openaire_cris_publications/7d6f82fc-b0f4-4bb9-b6b1-1266276f1ca8","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/7d6f82fc-b0f4-4bb9-b6b1-1266276f1ca8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Adamaszek, A, Har-Peled, S & Wiese, A 2019, 'Approximation Schemes for Independent Set and Sparse Subsets of Polygons', Journal of the ACM, vol. 66, no. 4, 29, pp. 1-40. https://doi.org/10.1145/3326122","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/bbb3b6f4-06c0-4248-bbe4-c22dfdf4025f","is_oa":false,"landing_page_url":"https://curis.ku.dk/portal/da/publications/approximation-schemes-for-independent-set-and-sparse-subsets-of-polygons(bbb3b6f4-06c0-4248-bbe4-c22dfdf4025f).html","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/bbb3b6f4-06c0-4248-bbe4-c22dfdf4025f","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/bbb3b6f4-06c0-4248-bbe4-c22dfdf4025f","pdf_url":null,"source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Adamaszek , A , Har-Peled , S & Wiese , A 2019 , ' Approximation schemes for independent set and sparse subsets of polygons ' , Journal of the ACM , vol. 66 , no. 4 , 29 . https://doi.org/10.1145/3326122","raw_type":"article"},{"id":"pmh:oai:research.vu.nl:publications/7d6f82fc-b0f4-4bb9-b6b1-1266276f1ca8","is_oa":false,"landing_page_url":"https://hdl.handle.net/1871.1/7d6f82fc-b0f4-4bb9-b6b1-1266276f1ca8","pdf_url":null,"source":{"id":"https://openalex.org/S4306401107","display_name":"VU Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I865915315","host_organization_name":"Vrije Universiteit Amsterdam","host_organization_lineage":["https://openalex.org/I865915315"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Adamaszek, A, Har-Peled, S & Wiese, A 2019, 'Approximation Schemes for Independent Set and Sparse Subsets of Polygons', Journal of the ACM, vol. 66, no. 4, 29, pp. 1-40. https://doi.org/10.1145/3326122","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1145/3326122","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3326122","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3326122","source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3190678944","display_name":null,"funder_award_id":"CCF-12-17462","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6271038849","display_name":"AF: Small:  Efficient Proximity and Similarity Search in Computational Geometry","funder_award_id":"1217462","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320322928","display_name":"Danmarks Frie Forskningsfond","ror":"https://ror.org/02sptwz63"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2604794478.pdf","grobid_xml":"https://content.openalex.org/works/W2604794478.grobid-xml"},"referenced_works_count":56,"referenced_works":["https://openalex.org/W42852446","https://openalex.org/W81474395","https://openalex.org/W596522316","https://openalex.org/W1530649098","https://openalex.org/W1537545978","https://openalex.org/W1544357472","https://openalex.org/W1603950378","https://openalex.org/W1604629374","https://openalex.org/W1796910040","https://openalex.org/W1808696436","https://openalex.org/W1843208812","https://openalex.org/W1924557110","https://openalex.org/W1930019869","https://openalex.org/W1998375208","https://openalex.org/W2002985966","https://openalex.org/W2009419163","https://openalex.org/W2012427196","https://openalex.org/W2013451793","https://openalex.org/W2019814699","https://openalex.org/W2026653490","https://openalex.org/W2028747718","https://openalex.org/W2030279496","https://openalex.org/W2031149390","https://openalex.org/W2034834286","https://openalex.org/W2038643780","https://openalex.org/W2039079162","https://openalex.org/W2049413646","https://openalex.org/W2050459520","https://openalex.org/W2058432138","https://openalex.org/W2059155916","https://openalex.org/W2063572899","https://openalex.org/W2071091006","https://openalex.org/W2077735330","https://openalex.org/W2084266654","https://openalex.org/W2086551550","https://openalex.org/W2094511120","https://openalex.org/W2097800052","https://openalex.org/W2099819831","https://openalex.org/W2100961486","https://openalex.org/W2110282707","https://openalex.org/W2110367141","https://openalex.org/W2127719709","https://openalex.org/W2130921208","https://openalex.org/W2139225572","https://openalex.org/W2144713886","https://openalex.org/W2162048995","https://openalex.org/W2165142526","https://openalex.org/W2498753647","https://openalex.org/W2609210027","https://openalex.org/W2610183793","https://openalex.org/W2770043005","https://openalex.org/W2949765771","https://openalex.org/W2963755366","https://openalex.org/W2963964459","https://openalex.org/W4254977685","https://openalex.org/W6631241020"],"related_works":["https://openalex.org/W2097569240","https://openalex.org/W2468848027","https://openalex.org/W2073435288","https://openalex.org/W2950770309","https://openalex.org/W2952205479","https://openalex.org/W2952838392","https://openalex.org/W4298855452","https://openalex.org/W2148431844","https://openalex.org/W2091843659","https://openalex.org/W2106802199"],"abstract_inverted_index":{"We":[0],"present":[1],"a":[2,11,19,100,113,136,149,177,205,212],"(1+\u03b5)-approximation":[3],"algorithm":[4,33,50,110],"with":[5,125],"quasi-polynomial":[6],"running":[7],"time":[8,32,151],"for":[9,34,155,203],"computing":[10,55],"maximum":[12,57,82,157],"weight":[13,158],"independent":[14,159,222],"set":[15,21,63],"of":[16,22,41,54,60,64,84,91,102,122,135,143,180,183,187,191,221],"polygons":[17,23,65,85,130],"from":[18,131],"given":[20,62],"in":[24],"the":[25,29,35,49,52,56,61,81,88,92,120,132,141,156,164,181,184,188,193,199],"plane.":[26],"Contrasting":[27],"this,":[28],"best-known":[30],"polynomial":[31,150],"problem":[36,53,165],"has":[37,169],"an":[38],"approximation":[39],"ratio":[40],"n":[42],"\u03b5":[43],".":[44],"Surprisingly,":[45],"we":[46,75,147,162],"can":[47,79],"extend":[48],"to":[51],"cardinality":[58],"subset":[59,83,93],"whose":[66,117,172],"intersection":[67,89],"graph":[68,90],"fulfills":[69],"some":[70],"sparsity":[71],"condition.":[72],"For":[73,140],"example,":[74],"show":[76],"that":[77,87,128],"one":[78,170],"approximate":[80],"such":[86],"is":[94,119,174,197,207],"planar":[95],"or":[96],"does":[97],"not":[98],"contain":[99],"cycle":[101],"length":[103,173,182],"4":[104],"(i.e.,":[105],"K":[106],"2,2":[107],").":[108],"Our":[109],"relies":[111],"on":[112],"recursive":[114],"partitioning":[115,216],"scheme,":[116,217],"backbone":[118],"existence":[121],"balanced":[123],"cuts":[124],"small":[126,137],"complexity":[127],"intersect":[129],"optimal":[133],"solution":[134],"total":[138],"weight.":[139],"case":[142,202],"large":[144],"axis-parallel":[145],"rectangles,":[146],"provide":[148],"(1":[152],"+":[153],"\u03b5)-approximation":[154],"set.":[160],"Specifically,":[161],"consider":[163],"where":[166],"each":[167],"rectangle":[168],"edge":[171,186],"at":[175],"least":[176],"constant":[178],"fraction":[179],"corresponding":[185],"bounding":[189],"box":[190],"all":[192],"input":[194],"elements.":[195],"This":[196],"now":[198],"most":[200],"general":[201],"which":[204,218],"PTAS":[206],"known,":[208],"and":[209,214],"it":[210],"requires":[211],"new":[213],"involved":[215],"should":[219],"be":[220],"interest.":[223]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}