{"id":"https://openalex.org/W4287424652","doi":"https://doi.org/10.48550/arxiv.2101.00326","title":"Approximating Maximum Independent Set for Rectangles in the Plane","display_name":"Approximating Maximum Independent Set for Rectangles in the Plane","publication_year":2021,"publication_date":"2021-01-01","ids":{"openalex":"https://openalex.org/W4287424652","doi":"https://doi.org/10.48550/arxiv.2101.00326"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2101.00326","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2101.00326","pdf_url":"https://arxiv.org/pdf/2101.00326","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":null,"raw_type":"text"},"volume":null,"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2101.00326","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5015247956","display_name":"Joseph S. B. Mitchell","orcid":"https://orcid.org/0000-0002-0152-2279","observed_orcids":["https://orcid.org/0000-0002-0152-2279"]},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mitchell, Joseph S. B.","raw_affiliation_strings":["Stony Brook University , Stony Brook , NY 11794-3600 ,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Stony Brook University , Stony Brook , NY 11794-3600 ,","institution_ids":["https://openalex.org/I59553526"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015247956"],"corresponding_institution_ids":["https://openalex.org/I59553526"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.6317999958992004,"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.6317999958992004,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3582000136375427,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.002099999925121665,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/maximum-independent-set-problem","display_name":"maximum independent set","score":0.9980000257492065},{"id":"https://openalex.org/keywords/axis-aligned-rectangles","display_name":"axis-aligned rectangles","score":0.9539999961853027},{"id":"https://openalex.org/keywords/constant-factor-approximation","display_name":"constant-factor approximation","score":0.6759999990463257},{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.6349999904632568},{"id":"https://openalex.org/keywords/recursive-partitioning","display_name":"recursive partitioning","score":0.8379999995231628},{"id":"https://openalex.org/keywords/computational-geometry","display_name":"computational geometry","score":0.4620000123977661},{"id":"https://openalex.org/keywords/planar-graphs","display_name":"planar graphs","score":0.47099998593330383}],"concepts":[{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.72757887840271},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7051295042037964},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.7002714276313782},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6973980069160461},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6540758609771729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.652245283126831},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6059035658836365},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.576837420463562},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5111027359962463},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.22525131702423096},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.16856953501701355},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1530582308769226},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2101.00326","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2101.00326","pdf_url":"https://arxiv.org/pdf/2101.00326","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2101.00326","doi":"https://doi.org/10.48550/arxiv.2101.00326","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2101.00326","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2101.00326","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2101.00326","pdf_url":"https://arxiv.org/pdf/2101.00326","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"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":null,"raw_type":"text"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G949854251","display_name":"AF:Small:Geometric Optimization Problems for Routing, Searching, and Coverage in the Face of Uncertainty","funder_award_id":"2007275","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/F4320332180","display_name":"Defense Advanced Research Projects Agency","ror":"https://ror.org/02caytj08"},{"id":"https://openalex.org/F4320338291","display_name":"Sandia National Laboratories","ror":"https://ror.org/01apwpt12"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4287424652.pdf","grobid_xml":"https://content.openalex.org/works/W4287424652.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3122413977","https://openalex.org/W2030016043","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W3153687528","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1774334694","https://openalex.org/W1903284337"],"abstract_inverted_index":{"We":[0],"give":[1],"a":[2,18,35,57],"polynomial-time":[3,19],"constant-factor":[4],"approximation":[5,23],"algorithm":[6],"for":[7,11],"maximum":[8],"independent":[9],"set":[10],"(axis-aligned)":[12],"rectangles":[13],"in":[14,41,44],"the":[15,21,42],"plane.":[16],"Using":[17],"algorithm,":[20],"best":[22],"factor":[24],"previously":[25],"known":[26],"is":[27],"$O(\\log\\log":[28],"n)$.":[29],"The":[30],"results":[31],"are":[32,48,53],"based":[33],"on":[34],"new":[36],"form":[37],"of":[38,60],"recursive":[39],"partitioning":[40],"plane,":[43],"which":[45],"faces":[46],"that":[47],"constant-complexity":[49],"and":[50],"orthogonally":[51],"convex":[52],"recursively":[54],"partitioned":[55],"into":[56],"constant":[58],"number":[59],"such":[61],"faces.":[62]},"counts_by_year":[],"updated_date":"2026-09-30T09:27:27.532063","created_date":"2025-10-10T00:00:00"}