{"id":"https://openalex.org/W2016218947","doi":"https://doi.org/10.1002/net.3230080402","title":"The complexity of the network design problem","display_name":"The complexity of the network design problem","publication_year":1978,"publication_date":"1978-12-01","ids":{"openalex":"https://openalex.org/W2016218947","doi":"https://doi.org/10.1002/net.3230080402","mag":"2016218947"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230080402","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230080402","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":true,"oa_status":"green","oa_url":"https://ageconsearch.umn.edu/record/272157/files/erasmus094.pdf?subformat=pdfa","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5075693834","display_name":"David Johnson","orcid":"https://orcid.org/0000-0002-3569-8352"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"D. S. Johnson","raw_affiliation_strings":["Bell Laboratories Murray Hill, New Jersey","Bell Laboratories, Murray Hill, New Jersey"],"affiliations":[{"raw_affiliation_string":"Bell Laboratories Murray Hill, New Jersey","institution_ids":[]},{"raw_affiliation_string":"Bell Laboratories, Murray Hill, New Jersey","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5057978522","display_name":"Jan Karel Lenstra","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"J. K. Lenstra","raw_affiliation_strings":["Mathematisch Centrum Amsterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Mathematisch Centrum Amsterdam, The Netherlands","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5109834066","display_name":"A. H. G. Rinnooy Kan","orcid":null},"institutions":[{"id":"https://openalex.org/I913958620","display_name":"Erasmus University Rotterdam","ror":"https://ror.org/057w15z03","country_code":"NL","type":"education","lineage":["https://openalex.org/I913958620"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"A. H. G. Rinnooy Kan","raw_affiliation_strings":["Erasmus University Rotterdam, The Netherlands","Erasmus University; Rotterdam, The Netherlands"],"affiliations":[{"raw_affiliation_string":"Erasmus University Rotterdam, The Netherlands","institution_ids":["https://openalex.org/I913958620"]},{"raw_affiliation_string":"Erasmus University; Rotterdam, The Netherlands","institution_ids":["https://openalex.org/I913958620"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5075693834"],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":3.6892,"has_fulltext":true,"cited_by_count":398,"citation_normalized_percentile":{"value":0.93393813,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":98,"max":100},"biblio":{"volume":"8","issue":"4","first_page":"279","last_page":"285"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9979000091552734,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5898647308349609},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5844480991363525},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5838080644607544},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5559028387069702},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.5349869132041931},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4905092120170593},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.46284788846969604},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.44924846291542053},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4218237102031708},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4172719419002533},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4133698344230652},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.4130960702896118},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4118027687072754},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37022072076797485},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10958826541900635}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5898647308349609},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5844480991363525},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5838080644607544},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5559028387069702},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.5349869132041931},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4905092120170593},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.46284788846969604},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.44924846291542053},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4218237102031708},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4172719419002533},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4133698344230652},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.4130960702896118},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4118027687072754},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37022072076797485},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10958826541900635},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/net.3230080402","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230080402","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"},{"id":"pmh:oai:RePEc:ags:eureia:272157","is_oa":true,"landing_page_url":null,"pdf_url":"https://ageconsearch.umn.edu/record/272157/files/erasmus094.pdf?subformat=pdfa","source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"preprint"}],"best_oa_location":{"id":"pmh:oai:RePEc:ags:eureia:272157","is_oa":true,"landing_page_url":null,"pdf_url":"https://ageconsearch.umn.edu/record/272157/files/erasmus094.pdf?subformat=pdfa","source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2016218947.pdf","grobid_xml":"https://content.openalex.org/works/W2016218947.grobid-xml"},"referenced_works_count":12,"referenced_works":["https://openalex.org/W100926944","https://openalex.org/W1559178374","https://openalex.org/W1970074386","https://openalex.org/W2009990213","https://openalex.org/W2044038315","https://openalex.org/W2047517090","https://openalex.org/W2053891507","https://openalex.org/W2062533874","https://openalex.org/W2066194644","https://openalex.org/W2133615887","https://openalex.org/W2401610261","https://openalex.org/W4298300677"],"related_works":["https://openalex.org/W2121424666","https://openalex.org/W4301250310","https://openalex.org/W2055420561","https://openalex.org/W2067700950","https://openalex.org/W1669998927","https://openalex.org/W3162039195","https://openalex.org/W4250321999","https://openalex.org/W4205772203","https://openalex.org/W2045254727","https://openalex.org/W2361081252"],"abstract_inverted_index":{"Abstract":[0],"In":[1,50],"the":[2,22,27,30,44,57,63,73,76,84],"network":[3,58],"design":[4,59],"problem":[5],"we":[6,53],"are":[7,70],"given":[8],"a":[9,17,40,99],"weighted":[10],"undirected":[11],"graph.":[12],"We":[13],"wish":[14],"to":[15,39,78],"find":[16],"subgraph":[18],"which":[19],"connects":[20],"all":[21,35,67],"original":[23],"vertices":[24],"and":[25,72,90,105],"minimizes":[26],"sum":[28,45],"of":[29,46,86,91],"shortest":[31],"path":[32],"weights":[33,69],"between":[34],"vertex":[36],"pairs,":[37],"subject":[38],"budget":[41,74],"constraint":[42],"on":[43],"its":[47],"edge":[48,68],"weights.":[49],"this":[51],"note":[52],"establish":[54],"NP\u2010completeness":[55],"for":[56,62],"problem,":[60],"even":[61],"simple":[64],"case":[65],"where":[66],"equal":[71],"restricts":[75],"choice":[77],"spanning":[79],"trees.":[80],"This":[81],"result":[82],"justifies":[83],"development":[85],"enumerative":[87],"optimization":[88],"methods":[89],"approximation":[92],"algorithms,":[93],"such":[94],"as":[95],"those":[96],"described":[97],"in":[98],"recent":[100],"paper":[101],"by":[102],"R.":[103],"Dionne":[104],"M.":[106],"Florian.":[107]},"counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":11},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":11},{"year":2022,"cited_by_count":9},{"year":2021,"cited_by_count":17},{"year":2020,"cited_by_count":12},{"year":2019,"cited_by_count":16},{"year":2018,"cited_by_count":12},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":21},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":17},{"year":2012,"cited_by_count":9}],"updated_date":"2026-04-15T08:11:43.952461","created_date":"2025-10-10T00:00:00"}