{"id":"https://openalex.org/W1972674272","doi":"https://doi.org/10.1002/net.3230080306","title":"The complexity of the capacitated tree problem","display_name":"The complexity of the capacitated tree problem","publication_year":1978,"publication_date":"1978-09-01","ids":{"openalex":"https://openalex.org/W1972674272","doi":"https://doi.org/10.1002/net.3230080306","mag":"1972674272"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230080306","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230080306","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/A5104056982","display_name":"Christos H. Papadimitriou","orcid":"https://orcid.org/0009-0004-6462-2316"},"institutions":[{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"C. H. Papadimitriou","raw_affiliation_strings":["Harvard University Cambridge, Massachusetts","Harvard University, Cambridge, Massachusetts"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University Cambridge, Massachusetts","institution_ids":["https://openalex.org/I2801851002"]},{"raw_affiliation_string":"Harvard University, Cambridge, Massachusetts","institution_ids":["https://openalex.org/I2801851002"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5104056982"],"corresponding_institution_ids":["https://openalex.org/I2801851002"],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":3.1622,"has_fulltext":false,"cited_by_count":173,"citation_normalized_percentile":{"value":0.91579437,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"8","issue":"3","first_page":"217","last_page":"230"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9995999932289124,"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.9995999932289124,"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.9987999796867371,"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.9983000159263611,"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/simple","display_name":"Simple (philosophy)","score":0.644657552242279},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5856876969337463},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5214611887931824},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5045310258865356},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4857766926288605},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4795931875705719},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4339154064655304},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.32992827892303467},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.28854992985725403}],"concepts":[{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.644657552242279},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5856876969337463},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5214611887931824},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5045310258865356},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4857766926288605},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4795931875705719},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4339154064655304},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.32992827892303467},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28854992985725403},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230080306","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230080306","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W95841981","https://openalex.org/W1655990431","https://openalex.org/W1965680834","https://openalex.org/W1973942323","https://openalex.org/W2007610503","https://openalex.org/W2014068360","https://openalex.org/W2025325419","https://openalex.org/W2052862856","https://openalex.org/W2055569927","https://openalex.org/W2066194644","https://openalex.org/W2074744922","https://openalex.org/W2139582537","https://openalex.org/W2142022975","https://openalex.org/W2152413298","https://openalex.org/W2401610261","https://openalex.org/W3118260104","https://openalex.org/W6659715530"],"related_works":["https://openalex.org/W1585007175","https://openalex.org/W2382521049","https://openalex.org/W2144385241","https://openalex.org/W4253593777","https://openalex.org/W2951497643","https://openalex.org/W3101625811","https://openalex.org/W2165950148","https://openalex.org/W4300101996","https://openalex.org/W2338854850","https://openalex.org/W2184239527"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"examine":[2],"the":[3,11,21,38,42,46],"complexity":[4],"of":[5,13,41],"a":[6,49],"classical":[7],"problem":[8,22],"related":[9],"to":[10,25,61],"design":[12],"centralized":[14],"computer":[15],"networks.":[16],"Under":[17],"very":[18],"broad":[19],"assumptions":[20],"is":[23],"shown":[24],"be":[26],"NP\u2010complete,":[27],"and":[28],"hence":[29],"most":[30],"probably":[31],"intractable.":[32],"The":[33],"same":[34],"result":[35],"holds":[36],"for":[37],"\u201cEuclidean\u201d":[39],"case":[40,48],"problem;":[43],"however,":[44],"in":[45],"latter":[47],"simple":[50],"algorithm":[51],"produces":[52],"solutions":[53],"with":[54],"relative":[55],"error":[56],"almost":[57],"certainly":[58],"arbitrarily":[59],"close":[60],"zero.":[62]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":6}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}