{"id":"https://openalex.org/W2074744922","doi":"https://doi.org/10.1002/net.3230040403","title":"Computing capacitated minimal spanning trees efficiently","display_name":"Computing capacitated minimal spanning trees efficiently","publication_year":1974,"publication_date":"1974-01-01","ids":{"openalex":"https://openalex.org/W2074744922","doi":"https://doi.org/10.1002/net.3230040403","mag":"2074744922"},"language":"en","primary_location":{"id":"doi:10.1002/net.3230040403","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230040403","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/A5044239463","display_name":"Aaron Kershenbaum","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"A. Kershenbaum","raw_affiliation_strings":["Network Analysis Corporation Glen Cove, New York"],"affiliations":[{"raw_affiliation_string":"Network Analysis Corporation Glen Cove, New York","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5044239463"],"corresponding_institution_ids":[],"apc_list":{"value":3400,"currency":"USD","value_usd":3400},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":54,"citation_normalized_percentile":{"value":0.28067227,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"4","issue":"4","first_page":"299","last_page":"310"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9796000123023987,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/T12176","display_name":"Optimization and Packing Problems","score":0.9790999889373779,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/spanning-tree","display_name":"Spanning tree","score":0.7854119539260864},{"id":"https://openalex.org/keywords/minimum-spanning-tree","display_name":"Minimum spanning tree","score":0.7383573055267334},{"id":"https://openalex.org/keywords/kruskals-algorithm","display_name":"Kruskal's algorithm","score":0.704857587814331},{"id":"https://openalex.org/keywords/heuristics","display_name":"Heuristics","score":0.6086978912353516},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.5909191370010376},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5180673599243164},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5082240104675293},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46223101019859314},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.43131422996520996},{"id":"https://openalex.org/keywords/distributed-minimum-spanning-tree","display_name":"Distributed minimum spanning tree","score":0.4117330312728882},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4099045991897583},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.39028021693229675},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3659013509750366}],"concepts":[{"id":"https://openalex.org/C64331007","wikidata":"https://www.wikidata.org/wiki/Q831672","display_name":"Spanning tree","level":2,"score":0.7854119539260864},{"id":"https://openalex.org/C13743678","wikidata":"https://www.wikidata.org/wiki/Q240464","display_name":"Minimum spanning tree","level":2,"score":0.7383573055267334},{"id":"https://openalex.org/C63645285","wikidata":"https://www.wikidata.org/wiki/Q797860","display_name":"Kruskal's algorithm","level":3,"score":0.704857587814331},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.6086978912353516},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.5909191370010376},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5180673599243164},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5082240104675293},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46223101019859314},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.43131422996520996},{"id":"https://openalex.org/C65949645","wikidata":"https://www.wikidata.org/wiki/Q5283163","display_name":"Distributed minimum spanning tree","level":3,"score":0.4117330312728882},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4099045991897583},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.39028021693229675},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3659013509750366},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/net.3230040403","is_oa":false,"landing_page_url":"https://doi.org/10.1002/net.3230040403","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":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1964119857","https://openalex.org/W1964705035","https://openalex.org/W1964924757","https://openalex.org/W1965680834","https://openalex.org/W2017927472","https://openalex.org/W2052862856","https://openalex.org/W2058956837","https://openalex.org/W2074214908","https://openalex.org/W2139582537","https://openalex.org/W2152413298","https://openalex.org/W2163968305","https://openalex.org/W4242630784","https://openalex.org/W4244424643"],"related_works":["https://openalex.org/W4380840098","https://openalex.org/W2418231958","https://openalex.org/W2387385213","https://openalex.org/W4242086819","https://openalex.org/W2381121915","https://openalex.org/W2074214908","https://openalex.org/W4206043061","https://openalex.org/W2942013815","https://openalex.org/W2390742649","https://openalex.org/W2384589661"],"abstract_inverted_index":{"Abstract":[0],"An":[1],"analysis":[2],"is":[3,45,58],"made":[4],"of":[5,9,12,18,34,46,61,99],"the":[6,16,19,29,69,76,81,91,96],"computational":[7],"complexity":[8],"a":[10,26,41,59],"class":[11],"heuristic":[13],"algorithms":[14,101],"for":[15,88,107],"solution":[17],"minimal":[20],"spanning":[21,92],"tree":[22],"problem":[23],"subject":[24],"to":[25,68,79],"restriction":[27],"on":[28],"maximum":[30],"number":[31],"(or":[32],"weight)":[33],"nodes":[35,70],"in":[36,49,83,90,95],"any":[37],"subtree":[38],"rooted":[39],"at":[40],"distinguished":[42],"node.":[43],"This":[44],"particular":[47],"interest":[48],"designing":[50],"networks":[51],"with":[52,75],"branch":[53],"capacity":[54],"restrictions.":[55],"The":[56],"algorithm":[57],"modification":[60],"Kruskal's":[62],"Algorithm":[63],"where":[64],"weights":[65,110],"are":[66,86,102,111],"assigned":[67],"and":[71,104],"then":[72],"used,":[73],"along":[74],"arc":[77],"lengths,":[78],"select":[80],"order":[82],"which":[84],"arcs":[85],"considered":[87],"inclusion":[89],"tree.":[93],"Considerations":[94],"efficient":[97],"implementation":[98],"such":[100],"examined":[103],"several":[105],"heuristics":[106],"assigning":[108],"node":[109],"compared.":[112]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}