{"id":"https://openalex.org/W2737247819","doi":"https://doi.org/10.1007/s00453-017-0347-8","title":"Independent Set of Convex Polygons: From $$n^{\\epsilon }$$ n \u03f5 to $$1+\\epsilon $$ 1 + \u03f5 via Shrinking","display_name":"Independent Set of Convex Polygons: From $$n^{\\epsilon }$$ n \u03f5 to $$1+\\epsilon $$ 1 + \u03f5 via Shrinking","publication_year":2017,"publication_date":"2017-07-19","ids":{"openalex":"https://openalex.org/W2737247819","doi":"https://doi.org/10.1007/s00453-017-0347-8","mag":"2737247819"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-017-0347-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-017-0347-8","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00453-017-0347-8.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2Fs00453-017-0347-8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067503013","display_name":"Andreas Wiese","orcid":"https://orcid.org/0000-0003-3705-016X"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Andreas Wiese","raw_affiliation_strings":["Max Planck Institute for Computer Science, Saarbr\u00fccken, Germany"],"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Computer Science, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5067503013"],"corresponding_institution_ids":["https://openalex.org/I4210109712"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.12825112,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"80","issue":"3","first_page":"918","last_page":"934"},"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.9919000267982483,"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/T12288","display_name":"Optimization and Search Problems","score":0.988099992275238,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.8139890432357788},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.7070202231407166},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6937465667724609},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6257175207138062},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6014198064804077},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5260624289512634},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.47930708527565},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4642850458621979},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.45946168899536133},{"id":"https://openalex.org/keywords/monotonic-function","display_name":"Monotonic function","score":0.4258745312690735},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3599206805229187},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.17785382270812988},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.13784611225128174},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1113603413105011},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08805117011070251}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8139890432357788},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.7070202231407166},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6937465667724609},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6257175207138062},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6014198064804077},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5260624289512634},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.47930708527565},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4642850458621979},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.45946168899536133},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.4258745312690735},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3599206805229187},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.17785382270812988},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.13784611225128174},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1113603413105011},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08805117011070251},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1007/s00453-017-0347-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-017-0347-8","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00453-017-0347-8.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:pure.mpg.de:item_2496278","is_oa":true,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-002E-2602-4","pdf_url":"http://hdl.handle.net/11858/00-001M-0000-002E-2602-4","source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.mpg.de:item_2496278","is_oa":true,"landing_page_url":"https://hdl.handle.net/11858/00-001M-0000-002E-2602-4","pdf_url":"http://hdl.handle.net/11858/00-001M-0000-002E-2602-4","source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.mpg.de:item_2272697","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-002A-48AF-4","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"LATIN 2016: Theoretical Informatics","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:vu:oai:research.vu.nl:publications/0015204b-da6d-4e44-b25b-b1a48135e9b4","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/0015204b-da6d-4e44-b25b-b1a48135e9b4","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 80(3), 918 - 934. Springer New York","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1007/s00453-017-0347-8","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-017-0347-8","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs00453-017-0347-8.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320322434","display_name":"Max-Planck-Gesellschaft","ror":"https://ror.org/01hhn8329"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2737247819.pdf","grobid_xml":"https://content.openalex.org/works/W2737247819.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W81474395","https://openalex.org/W1537545978","https://openalex.org/W1544357472","https://openalex.org/W1604629374","https://openalex.org/W1924557110","https://openalex.org/W1998375208","https://openalex.org/W2009419163","https://openalex.org/W2012427196","https://openalex.org/W2013451793","https://openalex.org/W2026653490","https://openalex.org/W2039079162","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/W2100961486","https://openalex.org/W2110282707","https://openalex.org/W2127719709","https://openalex.org/W2162048995","https://openalex.org/W2289655550","https://openalex.org/W2949272645","https://openalex.org/W4206496220","https://openalex.org/W4245103222"],"related_works":["https://openalex.org/W2032550399","https://openalex.org/W2057791178","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W3153687528","https://openalex.org/W4287212971","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":{"In":[0,89,131],"the":[1,18,54,78,103,122,136,147,158],"Independent":[2],"Set":[3],"of":[4,13,29,74,139],"Convex":[5],"Polygons":[6],"problem":[7,39],"we":[8,21,68,92,98,134,155],"are":[9,99],"given":[10],"a":[11,25,34,49,105,109],"set":[12],"weighted":[14],"convex":[15],"polygons":[16,104],"in":[17,42],"plane":[19],"and":[20,37,57,77],"want":[22],"to":[23,101,142],"compute":[24],"maximum":[26],"weight":[27],"subset":[28],"non-overlapping":[30],"polygons.":[31,159],"This":[32],"is":[33,48],"very":[35,50],"natural":[36],"well-studied":[38],"with":[40],"applications":[41],"many":[43],"different":[44],"areas.":[45],"Unfortunately,":[46],"there":[47],"large":[51],"gap":[52],"between":[53],"known":[55,80],"upper":[56],"lower":[58,81,149],"bounds":[59],"for":[60,113],"this":[61,90,94,128,132],"problem.":[62],"The":[63],"best":[64,79],"polynomial":[65],"time":[66],"algorithm":[67],"know":[69],"has":[70],"an":[71,114],"approximation":[72,137],"ratio":[73,138],"$$n^{\\epsilon":[75,140],"}$$":[76,141],"bound":[82,150],"shows":[83],"only":[84],"strong":[85],"$${\\mathsf":[86],"{NP}}$$":[87],"-hardness.":[88],"paper":[91],"close":[93],"gap,":[95],"assuming":[96],"that":[97,151],"allowed":[100],"shrink":[102,157],"little":[106],"bit,":[107],"by":[108],"factor":[110],"$$1-\\delta":[111],"$$":[112],"arbitrarily":[115],"small":[116],"constant":[117],"$$\\delta":[118],">0$$":[119],",":[120],"while":[121],"compared":[123],"optimal":[124],"solution":[125],"cannot":[126],"do":[127],"(resource":[129],"augmentation).":[130],"setting,":[133],"improve":[135],"$$(1+\\epsilon":[143],")$$":[144],"which":[145],"matches":[146],"above":[148],"still":[152],"holds":[153],"if":[154],"can":[156]},"counts_by_year":[],"updated_date":"2026-03-25T14:56:36.534964","created_date":"2017-07-31T00:00:00"}