On the public citation graph

Computing capacitated minimal spanning trees efficiently

0 signed · 61 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/j.1538-7305.1957.tb01515.xopenalex-snapshot
Shortest Connection Networks And Some Generalizations
inferredcites →https://doi.org/10.1002/net.3230010105openalex-snapshot
Optimal design of centralized computer networks
inferredcites →https://doi.org/10.1002/net.3230030204openalex-snapshot
The Capacitated Minimum Spanning Tree
inferredcites →https://doi.org/10.1090/s0002-9939-1956-0078686-7openalex-snapshot
On the shortest spanning subtree of a graph and the traveling salesman problem
inferredcites →https://doi.org/10.1109/t-c.1972.223452openalex-snapshot
The Design or Multipoint Linkages in a Teleprocessing Tree Network
inferredcites →https://doi.org/10.1109/tcom.1974.1092122openalex-snapshot
Topological Design of Multipoint Teleprocessing Networks
inferredcites →https://doi.org/10.1145/800193.569965openalex-snapshot
On shortest paths and sorting
inferredcites →https://doi.org/10.1145/800193.569966openalex-snapshot
Computing minimum spanning trees efficiently
inferredcites →https://doi.org/10.1145/800280.811042openalex-snapshot
A unified algorithm for designing multidrop teleprocessing networks
inferredcites →https://doi.org/10.1147/sj.53.0142openalex-snapshot
On teleprocessing system design, Part II: A method for approximating the optimal network
inferredcites →https://doi.org/10.1515/9781400875184openalex-snapshot
Flows in Networks
inferredcites →https://doi.org/10.21236/ad0656904openalex-snapshot
MATHEMATICAL PROGRAMMING

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/9780470050118.ecse169openalex-snapshot
Genetic Algorithms
inferred← citeshttps://doi.org/10.1002/ett.4460030511openalex-snapshot
A survey of applications of mathematical programming to circuit‐switched network planning problems
inferred← citeshttps://doi.org/10.1002/net.3230080306openalex-snapshot
The complexity of the capacitated tree problem
inferred← citeshttps://doi.org/10.1002/net.3230120402openalex-snapshot
Topological design of centralized computer networks—formulations and algorithms
inferred← citeshttps://doi.org/10.1002/net.3230130203openalex-snapshot
Constructing a minimal‐cost spanning tree subject to resource constraints and flow requirements
inferred← citeshttps://doi.org/10.1002/net.3230130211openalex-snapshot
Centralized teleprocessing network design
inferred← citeshttps://doi.org/10.1002/net.3230190305openalex-snapshot
Networks synthesis and optimum network design problems: Models, solution methods and applications
inferred← citeshttps://doi.org/10.1002/net.3230230603openalex-snapshot
A branch and bound algorithm for the capacitated minimum spanning tree problem
inferred← citeshttps://doi.org/10.1007/978-1-4615-5087-7_3openalex-snapshot
Hierarchical Two Level Location Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-74377-4_14openalex-snapshot
A Centralized Network Design Problem with Genetic Algorithm Approach
inferred← citeshttps://doi.org/10.1007/978-3-7091-2748-3_6openalex-snapshot
Complexity of Optimum Undirected Tree Problems: A Survey of Recent Results
inferred← citeshttps://doi.org/10.1007/bf02098285openalex-snapshot
An exact algorithm for the capacitated shortest spanning arborescence
inferred← citeshttps://doi.org/10.1007/bf03398577openalex-snapshot
A Lagrangian Based Heuristic for the Design of Multipoint Linkages in a Communication Network with Unreliable Links and Node Outage Costs
inferred← citeshttps://doi.org/10.1007/bfb0083472openalex-snapshot
Topological network synthesis
inferred← citeshttps://doi.org/10.1007/s12597-022-00575-3openalex-snapshot
Design of capacitated degree constrained min-sum arborescence
inferred← citeshttps://doi.org/10.1016/0142-0615(79)90030-9openalex-snapshot
Computer-aided distribution system planning
inferred← citeshttps://doi.org/10.1016/0305-0548(81)90035-6openalex-snapshot
Current and future research directions in network optimization
inferred← citeshttps://doi.org/10.1016/0305-0548(83)90030-8openalex-snapshot
Routing and scheduling of vehicles and crews
inferred← citeshttps://doi.org/10.1016/0377-2217(80)90164-2openalex-snapshot
Complexity of spanning tree problems: Part I
inferred← citeshttps://doi.org/10.1016/0377-2217(89)90412-8openalex-snapshot
Heuristic methods and applications: A categorized survey
inferred← citeshttps://doi.org/10.1016/0377-2217(94)90377-8openalex-snapshot
Topological design of a centralized communication network with unreliable links and node outage costs
inferred← citeshttps://doi.org/10.1016/j.cor.2005.09.017openalex-snapshot
Enhanced second order algorithm applied to the capacitated minimum spanning tree problem
inferred← citeshttps://doi.org/10.1016/j.ecoleng.2017.03.021openalex-snapshot
An improved habitat model to evaluate the impact of water conservancy projects on Chinese sturgeon ( Acipenser sinensis ) spawning sites in the Yangtze River, China
inferred← citeshttps://doi.org/10.1016/j.ecolind.2023.110022openalex-snapshot
An improved 3D fish habitat assessment model based on the graph theory algorithm
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73239-0openalex-snapshot
Network Synthesis and Dynamic Network Optimization
inferred← citeshttps://doi.org/10.1016/s0969-6016(97)00026-9openalex-snapshot
Topological Design of Centralized Computer Networks
inferred← citeshttps://doi.org/10.1023/a:1014517910427openalex-snapshot
A Tabu Search Algorithm for Access Network Design
inferred← citeshttps://doi.org/10.1080/01966324.1986.10737201openalex-snapshot
The Minimum Spanning Tree Problem with Time Window Constraints
inferred← citeshttps://doi.org/10.1080/0305215x.2022.2108027openalex-snapshot
Solver-free heuristics to retrieve feasible points for offshore wind farm collection system
inferred← citeshttps://doi.org/10.1088/1742-6596/1356/1/012014openalex-snapshot
Heuristics-based design and optimization of offshore wind farms collection systems
inferred← citeshttps://doi.org/10.1088/1742-6596/2767/8/082021openalex-snapshot
Multidisciplinary Wind Farm Electrical Infrastructure Optimization
inferred← citeshttps://doi.org/10.1109/access.2019.2925873openalex-snapshot
Electrical Cable Optimization in Offshore Wind Farms—A Review
inferred← citeshttps://doi.org/10.1109/iccias.2006.294124openalex-snapshot
A Genetic Algorithm Approach on Capacitated Minimum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1109/mahc.1985.10011openalex-snapshot
On the History of the Minimum Spanning Tree Problem
inferred← citeshttps://doi.org/10.1109/pica.1979.720092openalex-snapshot
Distribution System Design Using Computer Graphics Technique
inferred← citeshttps://doi.org/10.1109/tcom.1980.1094601openalex-snapshot
Second-Order Greedy Algorithms for Centralized Teleprocessing Network Design
inferred← citeshttps://doi.org/10.1109/tcom.1985.1096250openalex-snapshot
Augmented Lagrangean Based Algorithms for Centralized Network Design
inferred← citeshttps://doi.org/10.1109/tnet.2009.2021430openalex-snapshot
Global Access Network Evolution
inferred← citeshttps://doi.org/10.1109/tr.2004.837522openalex-snapshot
Telecommunication Access Network Design With Reliability Constraints
inferred← citeshttps://doi.org/10.1145/1103963.1103967openalex-snapshot
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
inferred← citeshttps://doi.org/10.1145/322358.322367openalex-snapshot
Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
inferred← citeshttps://doi.org/10.1504/ijcnds.2014.063969openalex-snapshot
A new media access control layer quality of service multicast scheme for IEEE 802.11s-based wireless mesh networks
inferred← citeshttps://doi.org/10.3390/cleantechnol5030039openalex-snapshot
Offshore Electrical Grid Layout Optimization for Floating Wind—A Review
inferred← citeshttps://doi.org/10.4018/978-1-5225-7335-7.ch017openalex-snapshot
Capacitated Graph Theoretical Algorithms for Wireless Sensor Networks Towards Internet of Things
inferred← citeshttps://doi.org/10.5194/wes-2021-47-ac1openalex-snapshot
Reply on CC1
inferred← citeshttps://doi.org/10.5194/wes-2021-47-cc1openalex-snapshot
Comment on wes-2021-47
inferred← citeshttps://doi.org/10.5194/wes-2021-47-rc1openalex-snapshot
Review of wes-2021-47
inferred← citeshttps://doi.org/10.5194/wes-7-925-2022openalex-snapshot
A framework for simultaneous design of wind turbines and cable layout in offshore wind
inferred← citeshttps://doi.org/10.5821/dissertation-2117-95116openalex-snapshot
The capacitated minimum spanning tree problem
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.