{"id":"https://openalex.org/W2462811537","doi":"https://doi.org/10.1109/tcad.2016.2585761","title":"Finding Maximum Disjoint Set of Boundary Rectangles with Application to PCB Routing","display_name":"Finding Maximum Disjoint Set of Boundary Rectangles with Application to PCB Routing","publication_year":2016,"publication_date":"2016-01-01","ids":{"openalex":"https://openalex.org/W2462811537","doi":"https://doi.org/10.1109/tcad.2016.2585761","mag":"2462811537"},"language":"en","primary_location":{"id":"doi:10.1109/tcad.2016.2585761","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcad.2016.2585761","pdf_url":null,"source":{"id":"https://openalex.org/S100835903","display_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","issn_l":"0278-0070","issn":["0278-0070","1937-4151"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","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/A5004090246","display_name":"AmirMahdi Ahmadinejad","orcid":null},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]},{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["IR","US"],"is_corresponding":false,"raw_author_name":"Amirmahdi Ahmadinejad","raw_affiliation_strings":["Department of Computer Engineering, Sharif University of Technology, Tehran, Iran","Management Science and Engineering Department, Stanford University, Stanford, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]},{"raw_affiliation_string":"Management Science and Engineering Department, Stanford University, Stanford, CA, USA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5091009084","display_name":"Hamid Zarrabi-Zadeh","orcid":"https://orcid.org/0000-0002-2279-4775"},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Hamid Zarrabi-Zadeh","raw_affiliation_strings":["Department of Computer Engineering, Sharif University of Technology, Tehran, Iran"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Engineering, Sharif University of Technology, Tehran, Iran","institution_ids":["https://openalex.org/I133529467"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9785,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.79149805,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"1"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"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.9994999766349792,"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/T12288","display_name":"Optimization and Search Problems","score":0.9977999925613403,"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/disjoint-sets","display_name":"Disjoint sets","score":0.6429224014282227},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.6185261607170105},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6077115535736084},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5748856663703918},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5736837387084961},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5425998568534851},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5166928768157959},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4486690163612366},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4452899694442749},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.43290185928344727},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08939337730407715}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6429224014282227},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.6185261607170105},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6077115535736084},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5748856663703918},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5736837387084961},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5425998568534851},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5166928768157959},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4486690163612366},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4452899694442749},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.43290185928344727},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08939337730407715},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tcad.2016.2585761","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tcad.2016.2585761","pdf_url":null,"source":{"id":"https://openalex.org/S100835903","display_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","issn_l":"0278-0070","issn":["0278-0070","1937-4151"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1501644705","https://openalex.org/W1537545978","https://openalex.org/W1546588373","https://openalex.org/W1581053584","https://openalex.org/W2013451793","https://openalex.org/W2026034687","https://openalex.org/W2031149390","https://openalex.org/W2049423773","https://openalex.org/W2051390777","https://openalex.org/W2058646559","https://openalex.org/W2059818291","https://openalex.org/W2077735330","https://openalex.org/W2081254453","https://openalex.org/W2086551550","https://openalex.org/W2094511120","https://openalex.org/W2098408204","https://openalex.org/W2100265835","https://openalex.org/W2124195871","https://openalex.org/W2138421468","https://openalex.org/W2139775372","https://openalex.org/W2143764757","https://openalex.org/W2145273649","https://openalex.org/W2147776496","https://openalex.org/W2150455973","https://openalex.org/W4206496220","https://openalex.org/W4242492623","https://openalex.org/W6665108202","https://openalex.org/W6674663275","https://openalex.org/W6675231817","https://openalex.org/W6682548440"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W2012063272","https://openalex.org/W2348092930","https://openalex.org/W2138685729","https://openalex.org/W2062850566","https://openalex.org/W4308716484","https://openalex.org/W2040004034","https://openalex.org/W1553466895"],"abstract_inverted_index":{"Motivated":[0],"by":[1],"the":[2,14,25,57,62,68,75,85,106,119],"bus":[3],"escape":[4],"routing":[5],"problem":[6,49,86],"in":[7,51,61,102,112],"printed":[8],"circuit":[9],"boards":[10],"(PCBs),":[11],"we":[12],"study":[13],"following":[15],"optimization":[16],"problem:":[17],"given":[18],"a":[19,28,32,99,110],"set":[20],"of":[21,27,34,59,121],"rectangles":[22,36,60],"attached":[23],"to":[24],"boundary":[26],"rectangular":[29],"region,":[30],"find":[31,88],"subset":[33],"nonoverlapping":[35],"with":[37,91],"maximum":[38],"total":[39],"weight.":[40],"We":[41,77],"present":[42,79],"an":[43],"efficient":[44,81],"algorithm":[45,72,97],"that":[46,87],"solves":[47],"this":[48],"optimally":[50],"O(n4)":[52],"time,":[53,104],"where":[54],"n":[55],"is":[56],"number":[58],"input":[63],"instance.":[64],"This":[65],"improves":[66],"over":[67],"best":[69],"previous":[70],"O(n6)-time":[71],"available":[73],"for":[74,84],"problem.":[76],"also":[78],"two":[80],"approximation":[82,93,126],"algorithms":[83],"near-optimal":[89],"solutions":[90],"guaranteed":[92],"factors.":[94],"The":[95,115],"first":[96],"finds":[98],"2-approximate":[100],"solution":[101],"O(n2)":[103],"and":[105,125],"second":[107],"one":[108],"computes":[109],"4/3-approximation":[111],"O(n3)":[113],"time.":[114],"experimental":[116],"results":[117],"demonstrate":[118],"efficiency":[120],"both":[122],"our":[123],"exact":[124],"algorithms.":[127]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}