{"id":"https://openalex.org/W3145512143","doi":"https://doi.org/10.1109/aspdac.2011.5722308","title":"A provably good approximation algorithm for Rectangle Escape Problem with application to PCB routing","display_name":"A provably good approximation algorithm for Rectangle Escape Problem with application to PCB routing","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W3145512143","doi":"https://doi.org/10.1109/aspdac.2011.5722308","mag":"3145512143"},"language":"en","primary_location":{"id":"doi:10.1109/aspdac.2011.5722308","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2011.5722308","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011)","raw_type":"proceedings-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/A5100648940","display_name":"Qiang Ma","orcid":"https://orcid.org/0000-0002-1028-3505"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Qiang Ma","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103245455","display_name":"Hui Kong","orcid":"https://orcid.org/0000-0002-0002-1253"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hui Kong","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5053378706","display_name":"Martin D. F. Wong","orcid":"https://orcid.org/0000-0001-8274-9688"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Martin D. F. Wong","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Illinois, Urbana-Champaign, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5070795253","display_name":"Evangeline F. Y. Young","orcid":"https://orcid.org/0000-0003-0623-1590"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Evangeline F. Y. Young","raw_affiliation_strings":["Department of Computer Science and Engineering, Chinese University of Hong Kong, Hong Kong, China"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Engineering, Chinese University of Hong Kong, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5100648940"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":0.7949,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.78066528,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"843","last_page":"848"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10374","display_name":"Advanced Graph Theory Research","score":0.9944999814033508,"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.982200026512146,"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/rounding","display_name":"Rounding","score":0.7686207294464111},{"id":"https://openalex.org/keywords/rectangle","display_name":"Rectangle","score":0.7541466355323792},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.6781296730041504},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6517214179039001},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.6135972738265991},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5916029810905457},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5788494944572449},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5750667452812195},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5568321943283081},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.5413406491279602},{"id":"https://openalex.org/keywords/boundary","display_name":"Boundary (topology)","score":0.5192344784736633},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5125017166137695},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.48318663239479065},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.48126858472824097},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4333881735801697},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09630417823791504}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.7686207294464111},{"id":"https://openalex.org/C2781302577","wikidata":"https://www.wikidata.org/wiki/Q209","display_name":"Rectangle","level":2,"score":0.7541466355323792},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.6781296730041504},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6517214179039001},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.6135972738265991},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5916029810905457},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5788494944572449},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5750667452812195},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5568321943283081},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.5413406491279602},{"id":"https://openalex.org/C62354387","wikidata":"https://www.wikidata.org/wiki/Q875399","display_name":"Boundary (topology)","level":2,"score":0.5192344784736633},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5125017166137695},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.48318663239479065},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.48126858472824097},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4333881735801697},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09630417823791504},{"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","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},{"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/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/aspdac.2011.5722308","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2011.5722308","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"16th Asia and South Pacific Design Automation Conference (ASP-DAC 2011)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1480290975","https://openalex.org/W2003388450","https://openalex.org/W2011039300","https://openalex.org/W2043222823","https://openalex.org/W2124195871","https://openalex.org/W2145273649","https://openalex.org/W2214509675","https://openalex.org/W4230491051","https://openalex.org/W4242492623"],"related_works":["https://openalex.org/W2268207117","https://openalex.org/W3100114454","https://openalex.org/W2561769964","https://openalex.org/W2507810539","https://openalex.org/W2117839333","https://openalex.org/W2035016254","https://openalex.org/W2053393096","https://openalex.org/W1991979416","https://openalex.org/W1966079129","https://openalex.org/W276709744"],"abstract_inverted_index":{"In":[0,123],"this":[1],"paper,":[2],"we":[3],"introduce":[4],"and":[5,25,67,96],"study":[6],"the":[7,33,46,52,63,86,102,138,158,170],"Rectangle":[8],"Escape":[9],"Problem":[10],"(REP),":[11],"which":[12],"is":[13,35,58,65,88,107,129,142],"motivated":[14],"by":[15,90],"PCB":[16,149],"bus":[17,150],"escape":[18,44,151],"routing.":[19],"Given":[20],"a":[21,26,38,97,113,132,145],"rectangular":[22],"region":[23],"R":[24,57],"set":[27,146],"S":[28],"of":[29,48,117,147,169],"rectangles":[30],"within":[31,164],"R,":[32,49],"REP":[34,64,87,118],"to":[36,43,45,101,110,135],"choose":[37],"direction":[39],"for":[40,85,112,167],"each":[41,168],"rectangle":[42],"boundary":[47],"such":[50],"that":[51,62,69,157],"resultant":[53],"maximum":[54],"density":[55],"over":[56],"minimized.":[59],"We":[60],"prove":[61],"NP-Complete,":[66],"show":[68,156],"it":[70],"can":[71,161],"be":[72,162],"formulated":[73],"as":[74,131],"an":[75,125],"Integer":[76],"Linear":[77,92],"Program":[78],"(ILP).":[79],"A":[80],"provably":[81],"good":[82],"approximation":[83,105],"algorithm":[84,106],"developed":[89],"applying":[91],"Programming":[93],"(LP)":[94],"relaxation":[95],"special":[98],"rounding":[99],"technique":[100],"ILP.":[103],"This":[104],"also":[108],"shown":[109],"work":[111],"more":[114],"general":[115],"version":[116],"with":[119],"weights":[120],"(weighted":[121],"REP).":[122],"addition,":[124],"iterative":[126],"refinement":[127],"procedure":[128],"proposed":[130],"postprocessing":[133],"step":[134],"further":[136],"improve":[137],"results.":[139],"Our":[140],"approach":[141],"tested":[143],"on":[144],"industrial":[148],"routing":[152],"problems.":[153],"Experimental":[154],"results":[155],"optimal":[159],"solution":[160],"obtained":[163],"3":[165],"seconds":[166],"test":[171],"cases.":[172]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}