{"id":"https://openalex.org/W4229539033","doi":"https://doi.org/10.1109/aspdac.2011.5722265","title":"Track routing optimizing timing and yield","display_name":"Track routing optimizing timing and yield","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W4229539033","doi":"https://doi.org/10.1109/aspdac.2011.5722265"},"language":"en","primary_location":{"id":"doi:10.1109/aspdac.2011.5722265","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2011.5722265","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/A5058706214","display_name":"Xin Gao","orcid":"https://orcid.org/0000-0002-6671-7560"},"institutions":[{"id":"https://openalex.org/I117965899","display_name":"University of Hawai\u02bbi at M\u0101noa","ror":"https://ror.org/01wspgy28","country_code":"US","type":"education","lineage":["https://openalex.org/I117965899"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"X. Gao","raw_affiliation_strings":["Department of Electrical Engineering, University of Hawaii at Manoa, Honolulu, HI 96822","Department of Electrical Engineering, University of Hawaii at Manoa, Honolulu, HI, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Hawaii at Manoa, Honolulu, HI 96822","institution_ids":["https://openalex.org/I117965899"]},{"raw_affiliation_string":"Department of Electrical Engineering, University of Hawaii at Manoa, Honolulu, HI, USA","institution_ids":["https://openalex.org/I117965899"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016429780","display_name":"L. Macchiarlo","orcid":null},"institutions":[{"id":"https://openalex.org/I117965899","display_name":"University of Hawai\u02bbi at M\u0101noa","ror":"https://ror.org/01wspgy28","country_code":"US","type":"education","lineage":["https://openalex.org/I117965899"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"L. Macchiarlo","raw_affiliation_strings":["Department of Electrical Engineering, University of Hawaii at Manoa, Honolulu, HI 96822","University of Hawai'i at Manoa, Honolulu, HI, US"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, University of Hawaii at Manoa, Honolulu, HI 96822","institution_ids":["https://openalex.org/I117965899"]},{"raw_affiliation_string":"University of Hawai'i at Manoa, Honolulu, HI, US","institution_ids":["https://openalex.org/I117965899"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5058706214"],"corresponding_institution_ids":["https://openalex.org/I117965899"],"apc_list":null,"apc_paid":null,"fwci":0.7412,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.82990836,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"627","last_page":"632"},"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.9916999936103821,"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.9916999936103821,"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.9653000235557556,"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/T10571","display_name":"Robotic Mechanisms and Dynamics","score":0.9613000154495239,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sizing","display_name":"Sizing","score":0.6976865530014038},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.6771724224090576},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6762410402297974},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6254971027374268},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5691755414009094},{"id":"https://openalex.org/keywords/nonlinear-programming","display_name":"Nonlinear programming","score":0.5321492552757263},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5272842049598694},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5126408934593201},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.45634305477142334},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45306286215782166},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.4373184144496918},{"id":"https://openalex.org/keywords/track","display_name":"Track (disk drive)","score":0.420918732881546},{"id":"https://openalex.org/keywords/nonlinear-system","display_name":"Nonlinear system","score":0.3744562268257141},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2696062922477722}],"concepts":[{"id":"https://openalex.org/C2777767291","wikidata":"https://www.wikidata.org/wiki/Q1080291","display_name":"Sizing","level":2,"score":0.6976865530014038},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6771724224090576},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6762410402297974},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6254971027374268},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5691755414009094},{"id":"https://openalex.org/C115527620","wikidata":"https://www.wikidata.org/wiki/Q769909","display_name":"Nonlinear programming","level":3,"score":0.5321492552757263},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5272842049598694},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5126408934593201},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.45634305477142334},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45306286215782166},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.4373184144496918},{"id":"https://openalex.org/C89992363","wikidata":"https://www.wikidata.org/wiki/Q5961558","display_name":"Track (disk drive)","level":2,"score":0.420918732881546},{"id":"https://openalex.org/C158622935","wikidata":"https://www.wikidata.org/wiki/Q660848","display_name":"Nonlinear system","level":2,"score":0.3744562268257141},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2696062922477722},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C142362112","wikidata":"https://www.wikidata.org/wiki/Q735","display_name":"Art","level":0,"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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"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/C153349607","wikidata":"https://www.wikidata.org/wiki/Q36649","display_name":"Visual arts","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/aspdac.2011.5722265","is_oa":false,"landing_page_url":"https://doi.org/10.1109/aspdac.2011.5722265","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":11,"referenced_works":["https://openalex.org/W1761548667","https://openalex.org/W2102256773","https://openalex.org/W2154308245","https://openalex.org/W2170088633","https://openalex.org/W2171048418","https://openalex.org/W4210431029","https://openalex.org/W4244849466","https://openalex.org/W4255326129","https://openalex.org/W4299866835","https://openalex.org/W6633286957","https://openalex.org/W6680812728"],"related_works":["https://openalex.org/W2130484549","https://openalex.org/W4324118942","https://openalex.org/W2913057782","https://openalex.org/W2734993473","https://openalex.org/W4253768562","https://openalex.org/W2151484740","https://openalex.org/W2185064329","https://openalex.org/W2187229407","https://openalex.org/W2756132392","https://openalex.org/W2059909660"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,49,84],"propose":[4,85],"a":[5,57,69,80,86],"track":[6],"routing":[7],"algorithm":[8,15,37,101,107],"for":[9],"timing":[10,114],"and":[11,24,27,46],"yield":[12],"optimization.":[13],"The":[14,29],"solves":[16,89],"the":[17,43,90,100,112],"problem":[18,32,63,91],"in":[19],"two":[20],"stages:":[21],"wire":[22,25,30,40,44],"ordering,":[23],"spacing":[26,45],"sizing.":[28],"ordering":[31],"is":[33,108],"solved":[34],"by":[35,116],"an":[36],"based":[38],"on":[39],"merging.":[41],"For":[42],"sizing":[47],"problem,":[48],"show":[50,96],"that":[51,88,102],"it":[52],"can":[53,65],"be":[54,66],"represented":[55],"as":[56],"Mixed":[58],"Linear":[59],"Geometric":[60],"Programming":[61],"(MLGP)":[62],"which":[64],"transformed":[67],"into":[68],"convex":[70,76],"optimization":[71,77],"problem.":[72],"Since":[73],"general":[74],"nonlinear":[75],"may":[78],"take":[79],"long":[81],"running":[82],"time,":[83],"heuristic":[87],"much":[92],"faster.":[93],"Experimental":[94],"results":[95],"that,":[97],"compared":[98],"to":[99,110],"only":[103],"optimizes":[104],"yield,":[105],"our":[106],"able":[109],"improve":[111],"minimum":[113],"slack":[115],"20%.":[117]},"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":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-10T06:02:16.177343","created_date":"2025-10-10T00:00:00"}