{"id":"https://openalex.org/W2289655550","doi":"https://doi.org/10.4230/lipics.approx-random.2015.43","title":"How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking","display_name":"How to Tame Rectangles: Solving Independent Set and Coloring of Rectangles via Shrinking","publication_year":2015,"publication_date":"2015-01-01","ids":{"openalex":"https://openalex.org/W2289655550","doi":"https://doi.org/10.4230/lipics.approx-random.2015.43","mag":"2289655550"},"language":"en","primary_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:5293","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.43","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"type":"article","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.43","any_repository_has_fulltext":true},"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/I4210116091","display_name":"Department of Physics, Mathematics and Informatics","ror":"https://ror.org/023sm4k53","country_code":"BY","type":"facility","lineage":["https://openalex.org/I151823869","https://openalex.org/I4210116091"]}],"countries":["BY"],"is_corresponding":false,"raw_author_name":"Adamaszek, Anna","raw_affiliation_strings":["K\u00f8benhavns Universitet, Faculty of Science, Department of Computer Science, Department of Computer Science, DK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"K\u00f8benhavns Universitet, Faculty of Science, Department of Computer Science, Department of Computer Science, DK","institution_ids":["https://openalex.org/I4210116091"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5016828567","display_name":"Parinya Chalermsook","orcid":"https://orcid.org/0009-0000-2833-0472"},"institutions":[{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Chalermsook, Parinya","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]},{"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/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Wiese, Andreas","raw_affiliation_strings":["Algorithms and Complexity, MPI for Informatics, Max Planck Society"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Algorithms and Complexity, MPI for Informatics, Max Planck Society","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.3525,"has_fulltext":true,"cited_by_count":7,"citation_normalized_percentile":{"value":0.94520281,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"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.9994999766349792,"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.9994999766349792,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9944000244140625,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9839000105857849,"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/combinatorics","display_name":"Combinatorics","score":0.8081986904144287},{"id":"https://openalex.org/keywords/omega","display_name":"Omega","score":0.7481735944747925},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6831986308097839},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6235653758049011},{"id":"https://openalex.org/keywords/clique","display_name":"Clique","score":0.5311471223831177},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5011742115020752},{"id":"https://openalex.org/keywords/independent-set","display_name":"Independent set","score":0.48271653056144714},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4718121290206909},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.46287965774536133},{"id":"https://openalex.org/keywords/plane","display_name":"Plane (geometry)","score":0.42789486050605774},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4125223159790039},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38746851682662964},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35021430253982544},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.15601032972335815},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.10984912514686584},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.07775568962097168}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8081986904144287},{"id":"https://openalex.org/C2779557605","wikidata":"https://www.wikidata.org/wiki/Q9890","display_name":"Omega","level":2,"score":0.7481735944747925},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6831986308097839},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6235653758049011},{"id":"https://openalex.org/C2777035058","wikidata":"https://www.wikidata.org/wiki/Q1662634","display_name":"Clique","level":2,"score":0.5311471223831177},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5011742115020752},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.48271653056144714},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4718121290206909},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.46287965774536133},{"id":"https://openalex.org/C17825722","wikidata":"https://www.wikidata.org/wiki/Q17285","display_name":"Plane (geometry)","level":2,"score":0.42789486050605774},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4125223159790039},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38746851682662964},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35021430253982544},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.15601032972335815},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.10984912514686584},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.07775568962097168},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","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},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":5,"locations":[{"id":"pmh:oai:drops-oai.dagstuhl.de:5293","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.43","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/8cffd9fc-18c3-47a1-bb75-6352ea54d001","is_oa":false,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/8cffd9fc-18c3-47a1-bb75-6352ea54d001","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 M , Chalermsook , P & Wiese , A 2015 , ' How to tame rectangles : solving independent set and coloring of rectangles via shrinking ' , Leibniz International Proceedings in Informatics , vol. 40 , pp. 43-60 . https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2015.43","raw_type":"article"},{"id":"pmh:oai:pure.mpg.de:item_2395277","is_oa":false,"landing_page_url":"https://hdl.handle.net/11858/00-001M-0000-002C-613C-B","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":"Leibniz International Proceedings in Informatics","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:vu:oai:research.vu.nl:publications/2e7e43dc-e6c8-46ae-9f96-dc1d56d10f64","is_oa":false,"landing_page_url":"https://research.vu.nl/en/publications/2e7e43dc-e6c8-46ae-9f96-dc1d56d10f64","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":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2015), 40, 43 - 60","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"doi:10.4230/lipics.approx-random.2015.43","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.approx-random.2015.43","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:drops-oai.dagstuhl.de:5293","is_oa":true,"landing_page_url":"https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX-RANDOM.2015.43","pdf_url":null,"source":{"id":"https://openalex.org/S4377196569","display_name":"DROPS (Schloss Dagstuhl \u2013 Leibniz Center for Informatics)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I2799853480","host_organization_name":"Schloss Dagstuhl \u2013 Leibniz Center for Informatics","host_organization_lineage":["https://openalex.org/I2799853480"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"","raw_type":"InProceedings"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W3127082728","https://openalex.org/W2067936666","https://openalex.org/W2073435288","https://openalex.org/W2963158951","https://openalex.org/W2070751425","https://openalex.org/W2952838392","https://openalex.org/W2148431844","https://openalex.org/W2106802199","https://openalex.org/W2007607373","https://openalex.org/W4286235874"],"abstract_inverted_index":{"In":[0,175],"the":[1,20,59,63,92,123,130,154,166,170,194,240,244,252,256,272,285],"Maximum":[2],"Weight":[3],"Independent":[4],"Set":[5],"of":[6,15,31,56,80,125,133,136,147,169,205,243,250,287],"Rectangles":[7],"(MWISR)":[8],"problem,":[9],"we":[10,178,189,219],"are":[11,190],"given":[12],"a":[13,27,54,88,126,134,185,197,203,222,228,235,259,276,281],"collection":[14],"weighted":[16],"axis-parallel":[17],"rectangles":[18,114,138,195,257],"in":[19,48,78,129,184,216],"plane.":[21],"Our":[22,263],"goal":[23],"is":[24,87,109,122,162,275],"to":[25,36,44,165,192,254,279],"compute":[26],"maximum":[28,127],"weight":[29],"subset":[30],"pairwise":[32],"non-overlapping":[33],"rectangles.":[34],"Due":[35],"its":[37],"various":[38],"applications,":[39],"as":[40,42,85,268],"well":[41,76],"connections":[43],"many":[45],"other":[46],"problems":[47,183],"computer":[49],"science,":[50],"MWISR":[51,72,225,251],"has":[52,156,258],"received":[53],"lot":[55],"attention":[57],"from":[58],"computational":[60],"geometry":[61],"and":[62,94,141,153,226],"approximation":[64,83],"algorithms":[65],"community.":[66],"However,":[67],"despite":[68],"being":[69],"extensively":[70],"studied,":[71],"remains":[73],"not":[74],"very":[75],"understood":[77,107],"terms":[79],"polynomial":[81],"time":[82],"algorithms,":[84],"there":[86],"large":[89],"gap":[90,168,242],"between":[91],"upper":[93,145,237],"lower":[95],"bounds,":[96],"i.e.,":[97],"O(log":[98],"n\\":[99],"loglog":[100],"n)":[101],"v.s.":[102],"NP-hardness.":[103],"Another":[104],"important,":[105],"poorly":[106],"question":[108,161],"whether":[110],"one":[111],"can":[112,265],"color":[113],"with":[115,230],"at":[116],"most":[117],"O(omega(R))":[118,231],"colors":[119,232],"where":[120,188],"omega(R)":[121],"size":[124],"clique":[128],"intersection":[131],"graph":[132],"set":[135],"input":[137],"R.":[139],"Asplund":[140],"Gr\u00fcnbaum":[142],"obtained":[143],"an":[144,208,269],"bound":[146,238],"O(omega(R)^2)":[148],"about":[149],"50":[150],"years":[151],"ago,":[152],"result":[155],"remained":[157],"asymptotically":[158],"best.":[159],"This":[160],"strongly":[163],"related":[164],"integrality":[167,241],"canonical":[171,245],"LP":[172],"for":[173,207,224,284],"MWISR.":[174],"this":[176,217],"paper,":[177],"settle":[179],"above":[180],"three":[181],"open":[182],"relaxed":[186],"model":[187,274],"allowed":[191],"shrink":[193,255],"by":[196,202],"tiny":[198],"bit":[199],"(rescaling":[200],"them":[201],"factor":[204],"1-delta":[206],"arbitrarily":[209],"small":[210],"constant":[211,236],"delta":[212],">":[213],"0.":[214],"Namely,":[215],"model,":[218],"show":[220],"(i)":[221],"PTAS":[223],"(ii)":[227],"coloring":[229],"which":[233],"implies":[234],"on":[239],"LP.":[246],"For":[247],"some":[248],"applications":[249],"possibility":[253],"natural,":[260],"well-motivated":[261],"meaning.":[262],"results":[264],"be":[266],"seen":[267],"evidence":[270],"that":[271],"shrinking":[273],"promising":[277],"way":[278],"relax":[280],"geometric":[282],"problem":[283],"purpose":[286],"better":[288],"algorithmic":[289],"results.":[290]},"counts_by_year":[{"year":2020,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-15T18:14:33.161393","created_date":"2025-10-10T00:00:00"}