On the public citation graph
Minimal length tree networks on the unit sphere
0 signed · 42 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1001/archopht.1952.00920010678023openalex-snapshot
Geometry and the Imagination.
inferredcites →https://doi.org/10.1002/net.3230110104openalex-snapshot
An O( n log n ) heuristic for steiner minimal tree problems on the euclidean metric
inferredcites →https://doi.org/10.1002/net.3230170203openalex-snapshot
Steiner problem in networks: A survey
inferredcites →https://doi.org/10.1007/bf01588324openalex-snapshot
Steiner's problem and fagnano's result on the sphere
inferredcites →https://doi.org/10.1016/0002-9394(52)91076-3openalex-snapshot
Geometry and the Imagination
inferredcites →https://doi.org/10.1016/0166-0462(82)90004-7openalex-snapshot
Location problems on a sphere
inferredcites →https://doi.org/10.1016/s0167-5060(08)70332-7openalex-snapshot
Steiner Trees for Ladders
inferredcites →https://doi.org/10.1038/scientificamerican0189-84openalex-snapshot
The Shortest-Network Problem
inferredcites →https://doi.org/10.1080/0025570x.1969.11975961openalex-snapshot
Euclidean Constructibility in Graph-Minimization Problems
inferredcites →https://doi.org/10.1080/0025570x.1972.11976242openalex-snapshot
On Fermat's Problem on the Surface of a Sphere
inferredcites →https://doi.org/10.1080/03052157908902401openalex-snapshot
STEINER TREES, STEINER CIRCUITS AND THE INTERFERENCE PROBLEM IN BUILDING DESIGN
inferredcites →https://doi.org/10.1090/qam/233286openalex-snapshot
Steiner’s problem for set-terminals
inferredcites →https://doi.org/10.1090/s0002-9947-1983-0697066-5openalex-snapshot
Steiner Minimal Trees on Zig-Zag Lines
inferredcites →https://doi.org/10.1093/oso/9780195105193.001.0001openalex-snapshot
What Is Mathematics?
inferredcites →https://doi.org/10.1137/0132072openalex-snapshot
The Complexity of Computing Steiner Minimal Trees
inferredcites →https://doi.org/10.1137/0134003openalex-snapshot
A Lower Bound for the Steiner Tree Problem
inferredcites →https://doi.org/10.1137/0217035openalex-snapshot
Minimum Spanning Trees in k -Dimensional Space
inferredcites →https://doi.org/10.1145/282918.282923openalex-snapshot
Primitives for the manipulation of general subdivisions and the computation of Voronoi
inferredcites →https://doi.org/10.1145/321724.321733openalex-snapshot
The Generation of Minimal Trees with a Steiner Topology
inferredcites →https://doi.org/10.1287/opre.27.5.972openalex-snapshot
Location Dominance on Spherical Surfaces
inferredcites →https://doi.org/10.5555/34233.34235openalex-snapshot
Steiner problem in networks: a survey
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/net.3230260411openalex-snapshot
An O(N2) heuristic for steiner minimal trees in E3
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_53openalex-snapshot
Steiner Minimum Trees in E3: Theory, Algorithms, and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_17openalex-snapshot
Steiner Minimal Trees in E 3: Theory, Algorithms, and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_21openalex-snapshot
Shortest Networks on Surfaces
inferred← citeshttps://doi.org/10.1007/s12215-015-0209-7openalex-snapshot
An analytical solution of the weighted Fermat–Torricelli problem on a unit sphere
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00064-9openalex-snapshot
Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in E3
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70197-3openalex-snapshot
Chapter 6 Generalizations
inferred← citeshttps://doi.org/10.1080/01621459.2018.1529595openalex-snapshot
Spatial Homogeneity Pursuit of Regression Coefficients for Large Datasets
inferred← citeshttps://doi.org/10.1093/sysbio/syr098openalex-snapshot
Towards a Dynamic Analysis of Weighted Networks in Biogeography
inferred← citeshttps://doi.org/10.17077/etd.x06rk59iopenalex-snapshot
Exact and heuristic algorithms for the Euclidean Steiner tree problem
inferred← citeshttps://doi.org/10.2140/involve.2013.6.251openalex-snapshot
The 3-point Steiner problem on a cylinder
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.