{"id":"https://openalex.org/W2170730727","doi":"https://doi.org/10.1145/1187436.1216583","title":"Rectangle covers revisited computationally","display_name":"Rectangle covers revisited computationally","publication_year":2007,"publication_date":"2007-02-09","ids":{"openalex":"https://openalex.org/W2170730727","doi":"https://doi.org/10.1145/1187436.1216583","mag":"2170730727"},"language":"en","primary_location":{"id":"doi:10.1145/1187436.1216583","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1187436.1216583","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5091011695","display_name":"Laura Heinrich-Litan","orcid":null},"institutions":[{"id":"https://openalex.org/I4210156055","display_name":"Robert Bosch (Netherlands)","ror":"https://ror.org/057aydj06","country_code":"NL","type":"company","lineage":["https://openalex.org/I4210156055","https://openalex.org/I889804353"]},{"id":"https://openalex.org/I891521709","display_name":"Daimler (Germany)","ror":"https://ror.org/00m0j3d84","country_code":"DE","type":"company","lineage":["https://openalex.org/I891521709"]}],"countries":["DE","NL"],"is_corresponding":true,"raw_author_name":"Laura Heinrich-Litan","raw_affiliation_strings":["Robert Bosch GmbH, Daimlerstrasse, Leonberg"],"affiliations":[{"raw_affiliation_string":"Robert Bosch GmbH, Daimlerstrasse, Leonberg","institution_ids":["https://openalex.org/I4210156055","https://openalex.org/I891521709"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5082694588","display_name":"Marco E. L\u00fcbbecke","orcid":"https://orcid.org/0000-0002-2635-0522"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Marco E. L\u00fcbbecke","raw_affiliation_strings":["Technische Universit\u00e4t Berlin, Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Berlin, Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5091011695"],"corresponding_institution_ids":["https://openalex.org/I4210156055","https://openalex.org/I891521709"],"apc_list":null,"apc_paid":null,"fwci":1.6183,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.88145756,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"11","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.9998000264167786,"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.9998000264167786,"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.9973000288009644,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9905999898910522,"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/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.7387901544570923},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.6626233458518982},{"id":"https://openalex.org/keywords/cardinality","display_name":"Cardinality (data modeling)","score":0.6432371735572815},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5634171366691589},{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.562925398349762},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.5553589463233948},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5386791825294495},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5136998891830444},{"id":"https://openalex.org/keywords/covering-problems","display_name":"Covering problems","score":0.49419549107551575},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4870017170906067},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4602161645889282},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.46013444662094116},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.43446457386016846},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4143988788127899},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.4108079969882965},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3762933909893036},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.36657869815826416},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.317524254322052},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.08897292613983154}],"concepts":[{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.7387901544570923},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6626233458518982},{"id":"https://openalex.org/C87117476","wikidata":"https://www.wikidata.org/wiki/Q362383","display_name":"Cardinality (data modeling)","level":2,"score":0.6432371735572815},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5634171366691589},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.562925398349762},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.5553589463233948},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5386791825294495},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5136998891830444},{"id":"https://openalex.org/C103646786","wikidata":"https://www.wikidata.org/wiki/Q5179260","display_name":"Covering problems","level":3,"score":0.49419549107551575},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4870017170906067},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4602161645889282},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.46013444662094116},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.43446457386016846},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4143988788127899},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.4108079969882965},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3762933909893036},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.36657869815826416},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.317524254322052},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.08897292613983154},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"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},{"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/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1187436.1216583","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1187436.1216583","pdf_url":null,"source":{"id":"https://openalex.org/S201104086","display_name":"ACM Journal of Experimental Algorithmics","issn_l":"1084-6654","issn":["1084-6654"],"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":"ACM Journal of Experimental Algorithmics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W102483353","https://openalex.org/W144954708","https://openalex.org/W1527583442","https://openalex.org/W1966613935","https://openalex.org/W1973540452","https://openalex.org/W1978186063","https://openalex.org/W1990313671","https://openalex.org/W1992204028","https://openalex.org/W1992697971","https://openalex.org/W2029830880","https://openalex.org/W2066239131","https://openalex.org/W2069462265","https://openalex.org/W2088027604","https://openalex.org/W2095398244","https://openalex.org/W2113620306","https://openalex.org/W2143474538","https://openalex.org/W2153014861","https://openalex.org/W2172955861","https://openalex.org/W2611804663","https://openalex.org/W2988480584","https://openalex.org/W4300550233","https://openalex.org/W6680812728","https://openalex.org/W6844382842"],"related_works":["https://openalex.org/W1623845008","https://openalex.org/W3100114454","https://openalex.org/W2507810539","https://openalex.org/W2035016254","https://openalex.org/W1600160158","https://openalex.org/W2137277194","https://openalex.org/W3175189485","https://openalex.org/W2031277014","https://openalex.org/W4287593987","https://openalex.org/W1919775156"],"abstract_inverted_index":{"We":[0,22,88,148],"consider":[1],"the":[2,29,51,54,57,62,71,113,124,127,165,170,180],"problem":[3,168],"of":[4,13,20,56,112,129,142],"covering":[5,49],"an":[6,24,84],"orthogonal":[7],"polygon":[8,58],"with":[9],"a":[10,17,80,119,130,160,174],"minimum":[11],"number":[12],"axis-parallel":[14],"rectangles":[15],"from":[16,96],"computational":[18],"point":[19],"view.":[21],"propose":[23,118],"integer":[25],"program":[26],"which":[27,152],"is":[28,75,83],"first":[30],"general":[31],"approach":[32],"to":[33,38,45,61,139,163],"obtain":[34,89],"provably":[35],"optimal":[36],"solutions":[37],"this":[39,143],"well-studied":[40],"NP-hard":[41],"problem.":[42,183],"It":[43],"applies":[44],"common":[46],"variants":[47],"like":[48],"only":[50],"corners":[52],"or":[53],"boundary":[55],"and":[59,78,103,106],"also":[60],"weighted":[63],"case.":[64],"In":[65],"experiments,":[66],"it":[67],"turns":[68],"out":[69],"that":[70,156],"linear":[72,115],"programming":[73],"relaxation":[74],"extremely":[76],"tight":[77],"rounding":[79],"fractional":[81,131],"solution":[82],"immediate":[85],"high-quality":[86],"heuristic.":[87],"excellent":[90],"experimental":[91],"results":[92],"for":[93,107,179],"polygons":[94],"originating":[95],"VLSI":[97],"design,":[98],"fax":[99],"data":[100],"sheets,":[101],"black":[102],"white":[104],"images,":[105],"random":[108],"instances.":[109],"Making":[110],"use":[111,141],"dual":[114],"program,":[116],"we":[117,135],"stronger":[120],"lower":[121],"bound":[122,144],"on":[123],"optimum,":[125],"namely,":[126],"cardinality":[128],"stable":[132],"set.":[133],"Furthermore,":[134],"outline":[136],"ideas":[137],"how":[138],"make":[140,153],"in":[145,169],"primal--dual-based":[146],"algorithms.":[147],"give":[149],"partial":[150],"results,":[151],"us":[154],"believe":[155],"our":[157],"proposals":[158],"have":[159],"strong":[161],"potential":[162],"settle":[164],"main":[166],"open":[167],"area:":[171],"To":[172],"find":[173],"constant":[175],"factor":[176],"approximation":[177],"algorithm":[178],"rectangle":[181],"cover":[182]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}