On the public citation graph

Minimum bottleneck spanning trees with degree bounds

https://doi.org/10.1002/net.21710
0 signed · 32 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.1006/jagm.1997.0862openalex-snapshot
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees
inferredcites →https://doi.org/10.1007/bf02293049openalex-snapshot
Transitions in geometric minimum spanning trees
inferredcites →https://doi.org/10.1007/s00453-004-1103-4openalex-snapshot
Approximation Schemes for Degree-Restricted MST and Red–Blue Separation Problems
inferredcites →https://doi.org/10.1007/s43069-021-00101-zopenalex-snapshot
Worst-Case Analysis of a New Heuristic for the Travelling Salesman Problem
inferredcites →https://doi.org/10.1016/0020-0190(78)90030-3openalex-snapshot
The min-max spanning tree problem and some extensions
inferredcites →https://doi.org/10.1016/0167-6377(84)90077-4openalex-snapshot
Guaranteed performance heuristics for the bottleneck travelling salesman problem
inferredcites →https://doi.org/10.1016/0167-6377(91)90016-iopenalex-snapshot
Analysis of Christofides' heuristic: Some paths are more difficult than cycles
inferredcites →https://doi.org/10.1016/0196-6774(84)90029-4openalex-snapshot
On two geometric problems related to the travelling salesman problem
inferredcites →https://doi.org/10.1016/j.dam.2008.03.037openalex-snapshot
Degree-bounded minimum spanning trees
inferredcites →https://doi.org/10.1016/j.dam.2012.01.006openalex-snapshot
The bottleneck 2-connected k -Steiner network problem for k≤2
inferredcites →https://doi.org/10.1016/s0021-9800(70)80083-7openalex-snapshot
Bottleneck extrema
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/12.127452openalex-snapshot
Bottleneck Steiner trees in the plane
inferredcites →https://doi.org/10.1109/focs.2006.48openalex-snapshot
Minimum Bounded Degree Spanning Trees
inferredcites →https://doi.org/10.1109/mahc.1985.10011openalex-snapshot
On the History of the Minimum Spanning Tree Problem
inferredcites →https://doi.org/10.1137/s0097539794264585openalex-snapshot
Low-Degree Spanning Trees of Small Weight
inferredcites →https://doi.org/10.1145/1250790.1250887openalex-snapshot
Approximating minimum bounded degree spanning trees to within one of optimal
inferredcites →https://doi.org/10.1145/1542362.1542399openalex-snapshot
The Euclidean degree-4 minimum spanning tree problem is NP-hard
inferredcites →https://doi.org/10.1145/777792.777795openalex-snapshot
Euclidean bounded-degree spanning tree ratios
inferredcites →https://doi.org/10.4153/cmb-1968-037-0openalex-snapshot
On the Cube of a Graph

What points at this work

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

inferred← citeshttps://doi.org/10.1007/s00454-021-00286-4openalex-snapshot
Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
inferred← citeshttps://doi.org/10.1007/s10878-019-00490-2openalex-snapshot
Degree bounded bottleneck spanning trees in three dimensions
inferred← citeshttps://doi.org/10.1007/s10878-019-00509-8openalex-snapshot
The complexity of symmetric connectivity in directional wireless sensor networks
inferred← citeshttps://doi.org/10.1007/s10878-023-01031-8openalex-snapshot
Improved algorithms in directional wireless sensor networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2017.08.006openalex-snapshot
Upgrading min–max spanning tree problem under various cost functions
inferred← citeshttps://doi.org/10.1017/s0004972719001126openalex-snapshot
DEGREE BOUNDED GEOMETRIC SPANNING TREES WITH A BOTTLENECK OBJECTIVE FUNCTION
inferred← citeshttps://doi.org/10.1109/infocom.2018.8486363openalex-snapshot
Symmetric Connectivity Algotirthms in Multiple Directional Antennas Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/infocom53939.2023.10229093openalex-snapshot
Target Coverage and Connectivity in Directional Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1142/s0218195919500031openalex-snapshot
Algorithms for Euclidean Degree Bounded Spanning Tree Problems
inferred← citeshttps://doi.org/10.3390/sym17010020openalex-snapshot
Energy-Efficient Connectivity Algorithm for Directional Sensor Networks in Edge Intelligence Systems
inferred← citeshttps://doi.org/10.48550/arxiv.2010.12229openalex-snapshot
Throughput-Optimal Topology Design for Cross-Silo Federated Learning
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.