{"id":"https://openalex.org/W1987585312","doi":"https://doi.org/10.1137/s0097539796303123","title":"Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\\cal NP$-Complete","display_name":"Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is $\\cal NP$-Complete","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1987585312","doi":"https://doi.org/10.1137/s0097539796303123","mag":"1987585312"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539796303123","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796303123","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5085709873","display_name":"Tibor Szkaliczki","orcid":"https://orcid.org/0000-0002-7699-8132"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Tibor Szkaliczki","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5085709873"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.2958,"has_fulltext":false,"cited_by_count":40,"citation_normalized_percentile":{"value":0.915941,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"29","issue":"1","first_page":"274","last_page":"287"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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.9984999895095825,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9973999857902527,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/interval","display_name":"Interval (graph theory)","score":0.7053543329238892},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6659492254257202},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6307812929153442},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6157553195953369},{"id":"https://openalex.org/keywords/row","display_name":"Row","score":0.595341145992279},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.45083487033843994},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39173585176467896},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.19101980328559875}],"concepts":[{"id":"https://openalex.org/C2778067643","wikidata":"https://www.wikidata.org/wiki/Q166507","display_name":"Interval (graph theory)","level":2,"score":0.7053543329238892},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6659492254257202},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6307812929153442},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6157553195953369},{"id":"https://openalex.org/C135598885","wikidata":"https://www.wikidata.org/wiki/Q1366302","display_name":"Row","level":2,"score":0.595341145992279},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.45083487033843994},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39173585176467896},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.19101980328559875},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539796303123","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539796303123","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.46000000834465027}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W196306683","https://openalex.org/W1980672031","https://openalex.org/W2011039300","https://openalex.org/W2030621259","https://openalex.org/W2068849088","https://openalex.org/W2158598102"],"related_works":["https://openalex.org/W4281971614","https://openalex.org/W2390933768","https://openalex.org/W2467236363","https://openalex.org/W3175260668","https://openalex.org/W2953259538","https://openalex.org/W3008919008","https://openalex.org/W3122721839","https://openalex.org/W2184455175","https://openalex.org/W4247716783","https://openalex.org/W2132957413"],"abstract_inverted_index":{"The":[0,86],"present":[1],"article":[2],"concentrates":[3],"on":[4,17,88,190],"the":[5,21,34,44,56,108,126,138,141,146,152,155,160,174,181,187],"dogleg-free":[6,89],"Manhattan":[7,90],"model":[8],"where":[9],"horizontal":[10,31],"and":[11,23,122,125,154,186],"vertical":[12],"wire":[13,58,183],"segments":[14],"are":[15],"positioned":[16],"different":[18],"sides":[19],"of":[20,119,140,148,151,177],"board":[22],"each":[24,80],"net":[25,81],"(wire)":[26],"has":[27,82],"at":[28],"most":[29],"one":[30],"segment.":[32],"While":[33],"minimum":[35,57,109,182],"width":[36],"can":[37,92],"be":[38,93,130],"found":[39],"in":[40,43],"linear":[41],"time":[42],"single":[45],"row":[46,156],"routing,":[47],"apparently":[48],"there":[49,63],"was":[50],"no":[51,65],"efficient":[52],"algorithm":[53,71],"to":[54,67,100,129,159],"find":[55,68],"length.":[59],"We":[60,164],"show":[61,165],"that":[62,137,166],"is":[64,75,115,145,162,169],"hope":[66],"such":[69],"an":[70],"because":[72],"this":[73,104,167],"problem":[74,168],"${\\cal":[76,170,175],"NP}$-complete":[77],"even":[78],"if":[79],"only":[83],"two":[84],"terminals.":[85],"results":[87],"routing":[91,185],"connected":[94],"with":[95],"other":[96,178],"application":[97],"areas":[98],"related":[99],"interval":[101,111,142,191],"graphs.":[102,192],"In":[103],"paper":[105],"we":[106],"define":[107],"value":[110,147],"placement":[112],"problem.":[113],"There":[114],"given":[116],"a":[117,149],"set":[118],"weighted":[120],"intervals":[121,127],"w":[123],"rows":[124,135],"have":[128],"placed":[131],"without":[132],"overlapping":[133],"into":[134],"so":[136],"sum":[139,188],"values,":[143],"which":[144],"function":[150],"weight":[153],"number":[157],"assigned":[158],"interval,":[161],"minimum.":[163],"NP}$-complete.":[171],"This":[172],"implies":[173],"NP}$-completeness":[176],"problems":[179],"including":[180],"length":[184],"coloring":[189]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}