{"id":"https://openalex.org/W2060067940","doi":"https://doi.org/10.1002/net.3230170406","title":"Linear placement algorithms and applications to VLSI design","display_name":"Linear placement algorithms and applications to VLSI design","publication_year":1987,"publication_date":"1987-01-01","ids":{"openalex":"https://openalex.org/W2060067940","doi":"https://doi.org/10.1002/net.3230170406","mag":"2060067940"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230170406","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170406","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","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/A5039615312","display_name":"Chung\u2010Kuan Cheng","orcid":"https://orcid.org/0000-0002-9865-8390"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chung\u2010Kuan Cheng","raw_affiliation_strings":["Department of Electrical Engineering and Computer Sciences, University of California, San Diego, La Jolla, California 92093","University of California at San Diego, La Jolla"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Sciences, University of California, San Diego, La Jolla, California 92093","institution_ids":["https://openalex.org/I36258959"]},{"raw_affiliation_string":"University of California at San Diego, La Jolla","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5039615312"],"corresponding_institution_ids":["https://openalex.org/I36258959"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.5233,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.67438058,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"17","issue":"4","first_page":"439","last_page":"464"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":1.0,"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":1.0,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9993000030517578,"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"}},{"id":"https://openalex.org/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/very-large-scale-integration","display_name":"Very-large-scale integration","score":0.757826566696167},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.63017737865448},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5900838971138},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5877859592437744},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5311359763145447},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5239841341972351},{"id":"https://openalex.org/keywords/minimum-cut","display_name":"Minimum cut","score":0.5163275599479675},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.48026084899902344},{"id":"https://openalex.org/keywords/relation","display_name":"Relation (database)","score":0.47851812839508057},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4598771631717682},{"id":"https://openalex.org/keywords/graph-partition","display_name":"Graph partition","score":0.45362797379493713},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4439104497432709},{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.44292593002319336},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4361984133720398},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.4295716881752014},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.4231816828250885},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.268332839012146},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2236599326133728}],"concepts":[{"id":"https://openalex.org/C14580979","wikidata":"https://www.wikidata.org/wiki/Q876049","display_name":"Very-large-scale integration","level":2,"score":0.757826566696167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.63017737865448},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5900838971138},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5877859592437744},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5311359763145447},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5239841341972351},{"id":"https://openalex.org/C185690422","wikidata":"https://www.wikidata.org/wiki/Q6865438","display_name":"Minimum cut","level":2,"score":0.5163275599479675},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.48026084899902344},{"id":"https://openalex.org/C25343380","wikidata":"https://www.wikidata.org/wiki/Q277521","display_name":"Relation (database)","level":2,"score":0.47851812839508057},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4598771631717682},{"id":"https://openalex.org/C48903430","wikidata":"https://www.wikidata.org/wiki/Q491370","display_name":"Graph partition","level":3,"score":0.45362797379493713},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4439104497432709},{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.44292593002319336},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4361984133720398},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.4295716881752014},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.4231816828250885},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.268332839012146},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2236599326133728},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230170406","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230170406","pdf_url":null,"source":{"id":"https://openalex.org/S191798613","display_name":"Networks","issn_l":"0028-3045","issn":["0028-3045","1097-0037"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Networks","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6499999761581421,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1569458199","https://openalex.org/W1964119857","https://openalex.org/W2011039300","https://openalex.org/W2049994136","https://openalex.org/W2064535593","https://openalex.org/W2072974175","https://openalex.org/W2089651609","https://openalex.org/W2096521993","https://openalex.org/W2115049345","https://openalex.org/W2138136899","https://openalex.org/W2141523221","https://openalex.org/W2161455936","https://openalex.org/W4244424643","https://openalex.org/W4246891719"],"related_works":["https://openalex.org/W2141353198","https://openalex.org/W2186707160","https://openalex.org/W3141688457","https://openalex.org/W2078695342","https://openalex.org/W1974018476","https://openalex.org/W2095284441","https://openalex.org/W2121204510","https://openalex.org/W2080904092","https://openalex.org/W2590727506","https://openalex.org/W2381207282"],"abstract_inverted_index":{"Abstract":[0],"A":[1,169],"linear":[2,39,166],"placement":[3,40,96,167,178],"technique":[4],"that":[5,127,175],"uses":[6],"an":[7,123],"objective":[8],"function":[9],"of":[10,13,75,86,94,106,133,139,147],"the":[11,72,82,87,92,100,104,107,111,131,134,140,144,148],"sum":[12],"wiring":[14],"lengths":[15],"is":[16,119,154],"proposed.":[17],"The":[18,30],"method":[19,85,179],"evolves":[20],"from":[21],"well\u2010known":[22],"concepts":[23],"in":[24],"job":[25,34,52],"sequencing":[26,35,53],"and":[27,37,58,79,142],"network":[28,88],"flow.":[29],"relation":[31],"between":[32],"a":[33,64,151],"problem":[36,41,90],"this":[38],"was":[42],"demonstrated":[43],"by":[44],"Lawler.":[45],"Also,":[46],"Sidney":[47],"proposed":[48],"decomposition":[49],"algorithms":[50],"for":[51,71,136],"problems.":[54,97,168],"Building":[55],"on":[56],"Lawler's":[57],"Sidney's":[59],"work,":[60],"we":[61],"first":[62],"develop":[63],"polynomial\u2010time":[65],"algorithm":[66,153],"to":[67,91,129,156],"obtain":[68],"optimal":[69,124],"solutions":[70],"special":[73],"case":[74],"parallel":[76],"graphs.":[77],"Adolphson":[78],"Hu":[80],"applied":[81],"max\u2010flow":[83],"min\u2010cut":[84],"flow":[89],"partitioning":[93,117,138,146],"general":[95],"However,":[98],"when":[99],"cut":[101,105,113,135],"operation":[102],"creates":[103],"same":[108],"configuration":[109,132],"as":[110],"previous":[112],"operations,":[114],"no":[115],"additional":[116],"information":[118],"obtained.":[120],"We":[121],"devise":[122],"graph":[125],"modification":[126],"tries":[128],"change":[130],"further":[137],"problem,":[141],"achieve":[143],"maximum":[145],"problem.":[149],"Finally,":[150],"heuristic":[152],"derived":[155],"solve":[157],"some":[158],"Very":[159],"Large":[160],"Scale":[161],"Integrated":[162],"Circuits":[163],"(VLSI)":[164],"design":[165],"comparison":[170],"with":[171],"published":[172],"papers":[173],"shows":[174],"our":[176],"VLSI":[177],"produces":[180],"better":[181],"results.":[182]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}