On the public citation graph
A proof of the Gilbert-Pollak conjecture on the Steiner ratio
0 signed · 186 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.1007/bf01758756openalex-snapshot
How to find Steiner minimal trees in euclideand-space
inferredcites →https://doi.org/10.1007/bf01758757openalex-snapshot
On Steiner minimal trees withL p distance
inferredcites →https://doi.org/10.1007/bf02071984openalex-snapshot
A variational approach to the Steiner network problem
inferredcites →https://doi.org/10.1016/0097-3165(78)90058-4openalex-snapshot
Some remarks on the Steiner problem
inferredcites →https://doi.org/10.1016/0097-3165(82)90056-5openalex-snapshot
A short proof of a result of Pollak on Steiner minimal trees
inferredcites →https://doi.org/10.1016/0097-3165(85)90073-1openalex-snapshot
The steiner ratio conjecture is true for five points
inferredcites →https://doi.org/10.1016/0097-3165(91)90073-popenalex-snapshot
The Steiner ratio conjecture for six points
inferredcites →https://doi.org/10.1090/s0002-9947-1983-0697065-3openalex-snapshot
A New Bound for the Steiner Ratio
inferredcites →https://doi.org/10.1111/j.1749-6632.1985.tb14564.xopenalex-snapshot
A NEW BOUND FOR EUCLIDEAN STEINER MINIMAL TREES
inferredcites →https://doi.org/10.1137/0130013openalex-snapshot
On Steiner Minimal Trees with Rectilinear Distance
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/1097-0037(200007)35:4<287::aid-net8>3.0.co;2-ropenalex-snapshot
Reducing the Steiner problem in four uniform orientations
inferred← citeshttps://doi.org/10.1002/net.20285openalex-snapshot
Optimum Steiner ratio for gradient‐constrained networks connecting three points in 3‐space, part I
inferred← citeshttps://doi.org/10.1002/net.20406openalex-snapshot
Optimum steiner ratio for gradient-constrained networks connecting three points in 3-space, part II: The gradient-constraint m satisfies \documentclass{article} \usepackage{amsmath,amsfonts,amssymb}\pagestyle{empty}\begin{document}$ 1 \leq m \leq \sqrt{3}
inferred← citeshttps://doi.org/10.1002/net.3230240303openalex-snapshot
Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in R d
inferred← citeshttps://doi.org/10.1002/net.3230240404openalex-snapshot
A delaunay triangulation‐based heuristic for the euclidean steiner problem
inferred← citeshttps://doi.org/10.1002/net.3230260411openalex-snapshot
An O(N2) heuristic for steiner minimal trees in E3
inferred← citeshttps://doi.org/10.1002/prot.21257openalex-snapshot
Steiner minimal trees, twist angles, and the protein folding problem
inferred← citeshttps://doi.org/10.1007/0-387-23830-1_2openalex-snapshot
The Steiner Ratio of Banach-Minkowski spaces - A Survey
inferred← citeshttps://doi.org/10.1007/11892960_8openalex-snapshot
A Hybrid Evolutionary Algorithm for the Euclidean Steiner Tree Problem Using Local Searches
inferred← citeshttps://doi.org/10.1007/3-540-49381-6_35openalex-snapshot
The Steiner Tree Problem in λ4-geometry Plane
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_134openalex-snapshot
O(n log n)-average-time algorithm for shortest network under a given topology
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_437openalex-snapshot
Network Design Problems
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-4419-7997-1_54openalex-snapshot
Connections Between Continuous and Discrete Extremum Problems, Generalized Systems, andVariational Inequalities∗
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_56openalex-snapshot
Steiner Minimal Trees: An Introduction, Parallel Computation, and Future Work
inferred← citeshttps://doi.org/10.1007/978-1-4613-0255-1_1openalex-snapshot
Steiner Minimum Trees in Uniform Orientation Metrics
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_13openalex-snapshot
Steiner Minimal Trees: An Introduction, Parallel Computation, and Future Work
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/978-1-4613-0303-9_3openalex-snapshot
Connections between Nonlinear Programming and Discrete Optimization
inferred← citeshttps://doi.org/10.1007/978-1-4615-2025-2_7openalex-snapshot
Minimax and Its Applications
inferred← citeshttps://doi.org/10.1007/978-1-4757-3145-3_29openalex-snapshot
Piecewise concavity and discrete approaches to continuous minimax problems
inferred← citeshttps://doi.org/10.1007/978-1-4757-3171-2_1openalex-snapshot
The Steiner Ratio of finite-dimensional L p -spaces
inferred← citeshttps://doi.org/10.1007/978-1-4757-3171-2_5openalex-snapshot
Steiner Trees, Coordinate Systems and NP-Hardness
inferred← citeshttps://doi.org/10.1007/978-3-030-41258-6_20openalex-snapshot
The Fermat-Torricelli Problem of Triangles on the Sphere with Euclidean Metric: A Symbolic Solution with Maple
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_437-1openalex-snapshot
Network Design Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-13915-9_1openalex-snapshot
Euclidean and Minkowski Steiner Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-13915-9_2openalex-snapshot
Fixed Orientation Steiner Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-40673-2_4openalex-snapshot
Minimal Networks: A Review
inferred← citeshttps://doi.org/10.1007/978-3-540-70666-3_18openalex-snapshot
Rotational Steiner Ratio Problem Under Uniform Orientation Metrics
inferred← citeshttps://doi.org/10.1007/978-3-642-14866-8_5openalex-snapshot
Chapter 5. Realistic Computer Models
inferred← citeshttps://doi.org/10.1007/978-3-642-22300-6_10openalex-snapshot
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals
inferred← citeshttps://doi.org/10.1007/978-3-642-30504-7_4openalex-snapshot
Graph and Geometric Algorithms and Efficient Data Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-56645-5_4openalex-snapshot
The Steiner Ratio of $$ \mathcal{L}_p^3 $$
inferred← citeshttps://doi.org/10.1007/bf01293486openalex-snapshot
On greedy heuristics for steiner minimum trees
inferred← citeshttps://doi.org/10.1007/bf02061658openalex-snapshot
A primer of the Euclidean Steiner problem
inferred← citeshttps://doi.org/10.1007/bf02189328openalex-snapshot
Minimum steiner trees in normed planes
inferred← citeshttps://doi.org/10.1007/bfb0009501openalex-snapshot
The Steiner Minimal Tree problem in the λ-geometry plane
inferred← citeshttps://doi.org/10.1007/bfb0045105openalex-snapshot
A branch-and-bound algorithm for computing node weighted steiner minimum trees
inferred← citeshttps://doi.org/10.1007/bfb0053961openalex-snapshot
The Steiner tree problem and its generalizations
inferred← citeshttps://doi.org/10.1007/pl00009508openalex-snapshot
On Minimum Stars and Maximum Matchings
inferred← citeshttps://doi.org/10.1007/pl00009511openalex-snapshot
Computing the Degree-4 Shortest Network under a Given Topology
inferred← citeshttps://doi.org/10.1007/s00224-017-9749-xopenalex-snapshot
A PTAS for the Geometric Connected Facility Location Problem
inferred← citeshttps://doi.org/10.1007/s00453-007-9114-6openalex-snapshot
Approximation Schemes for Node-Weighted Geometric Steiner Tree Problems
inferred← citeshttps://doi.org/10.1007/s00453-008-9254-3openalex-snapshot
The Steiner Ratio Conjecture of Gilbert-Pollak May Still Be Open
inferred← citeshttps://doi.org/10.1007/s00453-009-9329-9openalex-snapshot
Minimum Weight Convex Steiner Partitions
inferred← citeshttps://doi.org/10.1007/s00453-011-9508-3openalex-snapshot
The Steiner Ratio Gilbert–Pollak Conjecture Is Still Open
inferred← citeshttps://doi.org/10.1007/s00453-012-9643-5openalex-snapshot
Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals
inferred← citeshttps://doi.org/10.1007/s00454-004-1117-3openalex-snapshot
Euclidean Bounded-Degree Spanning Tree Ratios
inferred← citeshttps://doi.org/10.1007/s10686-009-9177-2openalex-snapshot
Cost-effective infrastructure in a multi-antenna telescope layout
inferred← citeshttps://doi.org/10.1007/s10732-010-9137-zopenalex-snapshot
A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in ℜ d
inferred← citeshttps://doi.org/10.1007/s10766-013-0243-zopenalex-snapshot
A Survey of Parallel and Distributed Algorithms for the Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/s10852-004-6390-xopenalex-snapshot
A Sausage Heuristic for Steiner Minimal Trees in Three-Dimensional Euclidean Space
inferred← citeshttps://doi.org/10.1007/s10898-007-9250-1openalex-snapshot
Localization of minimax points
inferred← citeshttps://doi.org/10.1007/s10898-012-9967-3openalex-snapshot
Approximations for two variants of the Steiner tree problem in the Euclidean plane $${\mathbb{R}^2}$$
inferred← citeshttps://doi.org/10.1007/s10958-008-0034-zopenalex-snapshot
Canonical decompositions of piecewise affine mappings, polyhedra-traces, and geometrical variational problems
inferred← citeshttps://doi.org/10.1007/s11750-022-00642-4openalex-snapshot
A new heuristic for the Euclidean Steiner Tree Problem in $${\mathbb {R}}^n$$
inferred← citeshttps://doi.org/10.1016/0012-365x(93)e0183-5openalex-snapshot
Steiner minimal trees on regular polygons with centre
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00005-hopenalex-snapshot
A tight lower bound for the Steiner ratio in Minkowski planes
inferred← citeshttps://doi.org/10.1016/0012-365x(95)00071-4openalex-snapshot
Non-crossing of plane minimal spanning and minimal T1 networks
inferred← citeshttps://doi.org/10.1016/0167-6377(92)90053-6openalex-snapshot
A simple proof of the planar rectilinear Steiner ratio
inferred← citeshttps://doi.org/10.1016/0898-1221(96)00069-7openalex-snapshot
An average case analysis of a greedy algorithm for the on-line Steiner tree problem
inferred← citeshttps://doi.org/10.1016/b978-044482537-7/50016-4openalex-snapshot
Geometric Shortest Paths and Network Optimization
inferred← citeshttps://doi.org/10.1016/j.biosystemseng.2013.01.008openalex-snapshot
An operative approach for designing and optimising a pipeline network for slurry collection from dairy farms across a wide geographical area
inferred← citeshttps://doi.org/10.1016/j.comcom.2008.01.019openalex-snapshot
Multicast overlay spanning trees in ad hoc networks: Capacity bounds, protocol design and performance evaluation
inferred← citeshttps://doi.org/10.1016/j.ejc.2018.02.006openalex-snapshot
Steiner type ratios of Gromov–Hausdorff space
inferred← citeshttps://doi.org/10.1016/j.exmath.2013.12.002openalex-snapshot
Packing, covering and tiling in two-dimensional spaces
inferred← citeshttps://doi.org/10.1016/j.orl.2004.07.010openalex-snapshot
Two-connected Steiner networks: structural properties
inferred← citeshttps://doi.org/10.1016/j.rcim.2012.04.012openalex-snapshot
A bottleneck Steiner tree based multi-objective location model and intelligent optimization of emergency logistics systems
inferred← citeshttps://doi.org/10.1016/s0012-365x(96)00080-5openalex-snapshot
The Steiner ratio for the dual normed plane
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00201-4openalex-snapshot
Steiner tree problem with minimum number of Steiner points and bounded edge-length
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00465-1openalex-snapshot
On minimally k-edge-connected graphs and shortest k-edge-connected Steiner networks
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00267-1openalex-snapshot
The Steiner ratio of high-dimensional Banach–Minkowski spaces
inferred← citeshttps://doi.org/10.1016/s0166-218x(96)00045-5openalex-snapshot
On spanning 2-trees in a graph
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)70194-8openalex-snapshot
Chapter 3 The Steiner Ratio
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70373-xopenalex-snapshot
New Directions in Graph Theory (With an Emphasis on the Role of Applications)
inferred← citeshttps://doi.org/10.1016/s0167-6377(99)00068-1openalex-snapshot
On the structure and complexity of the 2-connected Steiner network problem in the plane
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00182-1openalex-snapshot
Approximations for Steiner trees with minimum number of Steiner points
inferred← citeshttps://doi.org/10.1023/a:1008384012064openalex-snapshot
Approximations for Steiner Trees with Minimum Number of Steiner Points
inferred← citeshttps://doi.org/10.1023/a:1009711003807openalex-snapshot
Compression Theorems and Steiner Ratios on Spheres
inferred← citeshttps://doi.org/10.1023/a:1009807006441openalex-snapshot
A 75° Angle Constraint for Plane Minimal T1 Trees
inferred← citeshttps://doi.org/10.1023/a:1009889023408openalex-snapshot
On Shortest k-Edge-Connected Steiner Networks in Metric Spaces
inferred← citeshttps://doi.org/10.1023/a:1011497227406openalex-snapshot
A Polynomial Time Approximation Scheme for the Problem of Interconnecting Highways
inferred← citeshttps://doi.org/10.1023/a:1020389712969openalex-snapshot
Minimum Networks for Four Points in Space
inferred← citeshttps://doi.org/10.1049/iet-wss.2014.0120openalex-snapshot
Data collection using miniature aerial vehicles in wireless sensor networks
inferred← citeshttps://doi.org/10.1070/im1997v061n06abeh000168openalex-snapshot
The geometry of minimal networks with a given topology and a fixed boundary
inferred← citeshttps://doi.org/10.1070/im2008v072n01abeh002392openalex-snapshot
Immersed polygons and their diagonal triangulations
inferred← citeshttps://doi.org/10.1070/im2012v076n02abeh002581openalex-snapshot
The geometry of inner spanning trees for planar polygons
inferred← citeshttps://doi.org/10.1070/sm2005v196n06abeh000903openalex-snapshot
Sets admitting connection by graphs of finite length
inferred← citeshttps://doi.org/10.1070/sm2012v203n05abeh004239openalex-snapshot
One-dimensional Gromov minimal filling problem
inferred← citeshttps://doi.org/10.1088/1742-6596/574/1/012073openalex-snapshot
An interactive programme for weighted Steiner trees
inferred← citeshttps://doi.org/10.1090/conm/597/11778openalex-snapshot
Some of Hyam’s Favourite Problems
inferred← citeshttps://doi.org/10.1090/conm/625/12490openalex-snapshot
Minimal fillings of finite metric spaces: The state of the art
inferred← citeshttps://doi.org/10.1103/physreve.59.6001openalex-snapshot
Large-scale optimization of neuron arbors
inferred← citeshttps://doi.org/10.1109/82.673638openalex-snapshot
Steiner tree constructions in λ/sub 3/-metric
inferred← citeshttps://doi.org/10.1109/access.2019.2901094openalex-snapshot
Revisiting the Isoperimetric Graph Partitioning Problem
inferred← citeshttps://doi.org/10.1109/icamechs.2013.6681729openalex-snapshot
A hierarchical planning algorithm based on network topology analysis for minimal Steiner tree problems
inferred← citeshttps://doi.org/10.1109/icc.2015.7249345openalex-snapshot
A distributed algorithm to construct multicast trees in wireless multi-hop networks
inferred← citeshttps://doi.org/10.1109/icisce.2018.00128openalex-snapshot
Two Variants of the Full Steiner Tree Construction Problems
inferred← citeshttps://doi.org/10.1109/icnp.2008.4697040openalex-snapshot
RelayCast: Scalable multicast routing in Delay Tolerant Networks
inferred← citeshttps://doi.org/10.1109/icpads.2005.201openalex-snapshot
Multicast Scaling Properties in Massively Dense Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/icuas.2016.7502524openalex-snapshot
Autonomous location of mobile wireless relay nodes
inferred← citeshttps://doi.org/10.1109/infcom.2011.5935252openalex-snapshot
Heterogeneity increases multicast capacity in clustered network
inferred← citeshttps://doi.org/10.1109/infcom.2011.5935253openalex-snapshot
General capacity scaling of wireless networks
inferred← citeshttps://doi.org/10.1109/iscas.1997.621428openalex-snapshot
On the Steiner tree problem in L/sub 3/-metric [VLSI wiring]
inferred← citeshttps://doi.org/10.1109/isie.2015.7281437openalex-snapshot
A case study on optimizing an electrical distribution network using a genetic algorithm
inferred← citeshttps://doi.org/10.1109/mwscas.2002.1187293openalex-snapshot
Octilinear Steiner tree construction
inferred← citeshttps://doi.org/10.1109/sfcs.1996.548458openalex-snapshot
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
inferred← citeshttps://doi.org/10.1109/ssci.2017.8285169openalex-snapshot
Variable length encoded genetic algorithm for optimal electrical distribution network routing
inferred← citeshttps://doi.org/10.1109/tc.2002.1032631openalex-snapshot
Computing the shortest network under a fixed topology
inferred← citeshttps://doi.org/10.1109/tc.2002.1032632openalex-snapshot
Computing the shortest network under a fixed topology
inferred← citeshttps://doi.org/10.1109/tit.2016.2623317openalex-snapshot
Distributed Multicast Tree Construction in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tmc.2011.66openalex-snapshot
Efficient Rendezvous Algorithms for Mobility-Enabled Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1109/tnet.2008.927256openalex-snapshot
Multicast Capacity of Wireless Ad Hoc Networks
inferred← citeshttps://doi.org/10.1109/tnet.2010.2050901openalex-snapshot
The Multicast Capacity of Large Multihop Wireless Networks
inferred← citeshttps://doi.org/10.1109/tnet.2013.2255065openalex-snapshot
Multicast Capacity With Max-Min Fairness for Heterogeneous Networks
inferred← citeshttps://doi.org/10.1109/tnse.2021.3112670openalex-snapshot
Efficient Block Propagation in Wireless Blockchain Networks and Its Application in Bitcoin
inferred← citeshttps://doi.org/10.1111/itor.12182openalex-snapshot
Branched coverings and Steiner ratio
inferred← citeshttps://doi.org/10.1137/0221059openalex-snapshot
Reducing the Steiner Problem in a Normed Space
inferred← citeshttps://doi.org/10.1137/s0097539703435297openalex-snapshot
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
inferred← citeshttps://doi.org/10.1137/s0097539794264585openalex-snapshot
Low-Degree Spanning Trees of Small Weight
inferred← citeshttps://doi.org/10.1137/s0097539795281086openalex-snapshot
Thek-Steiner Ratio in Graphs
inferred← citeshttps://doi.org/10.1137/s0097539798347190openalex-snapshot
Minimum Networks in Uniform Orientation Metrics
inferred← citeshttps://doi.org/10.1137/s0895480196309791openalex-snapshot
Finding Subsets Maximizing Minimum Structures
inferred← citeshttps://doi.org/10.1142/s1793830911001036openalex-snapshot
ON CHARACTERISTIC AREA OF STEINER TREE
inferred← citeshttps://doi.org/10.1145/1287853.1287886openalex-snapshot
Multicast capacity for large scale wireless ad hoc networks
inferred← citeshttps://doi.org/10.1145/1288107.1288141openalex-snapshot
The multicast capacity of large multihop wireless networks
inferred← citeshttps://doi.org/10.1145/195058.195212openalex-snapshot
Low degree spanning trees of small weight
inferred← citeshttps://doi.org/10.1145/2632951.2632973openalex-snapshot
Modeling data dissemination in online social networks
inferred← citeshttps://doi.org/10.1145/2746285.2746296openalex-snapshot
A Distributed Algorithm to Construct Multicast Trees in WSNs
inferred← citeshttps://doi.org/10.1145/2814938openalex-snapshot
Improved Approximation Algorithms for Relay Placement
inferred← citeshttps://doi.org/10.1145/290179.290180openalex-snapshot
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
inferred← citeshttps://doi.org/10.1145/304893.304974openalex-snapshot
On minimum stars, minimum Steiner stars, and maximum matchings
inferred← citeshttps://doi.org/10.1145/3322497openalex-snapshot
Multicast Scaling of Capacity and Energy Efficiency in Heterogeneous Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1145/764808.764836openalex-snapshot
Wirelength reduction by using diagonal wire
inferred← citeshttps://doi.org/10.1145/777792.777795openalex-snapshot
Euclidean bounded-degree spanning tree ratios
inferred← citeshttps://doi.org/10.1201/9780849305696.ch15openalex-snapshot
New Dihedral Angle Measure for Protein Secondary Prediction
inferred← citeshttps://doi.org/10.1201/9781351235426-2openalex-snapshot
Approximation Schemes for Minimum-Cost k -Connectivity Problems in Geometric Graphs
inferred← citeshttps://doi.org/10.1287/ijoc.1040.0101openalex-snapshot
Steiner Trees and 3-D Macromolecular Conformation
inferred← citeshttps://doi.org/10.1287/moor.2017.0873openalex-snapshot
Minimizing Piecewise-Concave Functions Over Polyhedra
inferred← citeshttps://doi.org/10.17077/etd.x06rk59iopenalex-snapshot
Exact and heuristic algorithms for the Euclidean Steiner tree problem
inferred← citeshttps://doi.org/10.17706/jsw.11.10.1062-1072openalex-snapshot
Stree: An Interactive Program for Weighted Steiner Trees
inferred← citeshttps://doi.org/10.18130/v3gw0mopenalex-snapshot
Geometric Interconnection and Placement Algorithms
inferred← citeshttps://doi.org/10.22323/1.132.0025openalex-snapshot
Cost-effective infrastructure for the data signal transport
inferred← citeshttps://doi.org/10.22405/2226-8383-2021-22-5-138-160openalex-snapshot
Transformations of metrics that preserve the geometric characteristics of finite metric spaces
inferred← citeshttps://doi.org/10.2298/pim1308003iopenalex-snapshot
Gromov minimal fillings for finite metric spaces
inferred← citeshttps://doi.org/10.2991/meic-15.2015.61openalex-snapshot
A Survey of Optimization Method for Oil-gas Pipeline Network Layout
inferred← citeshttps://doi.org/10.3103/s0027132210030022openalex-snapshot
Generalized Maxwell formula for the length of a minimal tree with a given topology
inferred← citeshttps://doi.org/10.3724/sp.j.1001.2008.00888openalex-snapshot
A Survey of Proximity Graphs in Wireless Networks
inferred← citeshttps://doi.org/10.3990/1.9789036526609openalex-snapshot
Exact algorithms for Steiner tree problem
inferred← citeshttps://doi.org/10.4213/im534openalex-snapshot
Погруженные многоугольники и их диагональные триангуляции
inferred← citeshttps://doi.org/10.4213/im6595openalex-snapshot
Геометрия внутренних остовных деревьев для плоских многоугольников
inferred← citeshttps://doi.org/10.4213/sm7777openalex-snapshot
Одномерная проблема Громова о минимальном заполнении
inferred← citeshttps://doi.org/10.47749/t/unicamp.2016.979031openalex-snapshot
The geometric connected facility location problem
inferred← citeshttps://doi.org/10.48550/arxiv.1210.7788openalex-snapshot
An interactive programme for Steiner trees
inferred← citeshttps://doi.org/10.48550/arxiv.1304.6459openalex-snapshot
Measuring Transport Difficulty of Data Dissemination in Large-Scale Online Social Networks: An Interest-Driven Case
inferred← citeshttps://doi.org/10.5540/tema.2004.05.02.0249openalex-snapshot
The State of Art on the Steiner Ratio Value in R³
inferred← citeshttps://doi.org/10.5784/24-2-66openalex-snapshot
The Steiner ratio for points on a triangular lattice
inferred← citeshttps://doi.org/10.5860/choice.42-1619aopenalex-snapshot
Spanning trees and optimization problems
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.