On the public citation graph

An Approximation Scheme for Finding Steiner Trees with Obstacles

0 signed · 58 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/net.3230010203openalex-snapshot
Steiner's problem in graphs and its implications
inferredcites →https://doi.org/10.1002/net.3230010302openalex-snapshot
The steiner problem in graphs
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.3230120309openalex-snapshot
An algorithm for the steiner problem in graphs
inferredcites →https://doi.org/10.1002/net.3230130202openalex-snapshot
Steiner trees, partial 2–trees, and minimum IFI networks
inferredcites →https://doi.org/10.1002/net.3230170203openalex-snapshot
Steiner problem in networks: A survey
inferredcites →https://doi.org/10.1002/net.3230180108openalex-snapshot
Convexity and the Steiner tree problem
inferredcites →https://doi.org/10.1002/net.3230190107openalex-snapshot
Optimal enclosing regions in planar graphs
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1007/bf02187919openalex-snapshot
A decomposition theorem on Euclidean Steiner minimal trees
inferredcites →https://doi.org/10.1016/0020-0190(89)90129-4openalex-snapshot
Shortest enclosing walks and cycles in embedded graphs
inferredcites →https://doi.org/10.1016/0196-6774(87)90028-9openalex-snapshot
Convex hulls of piecewise-smooth Jordan curves
inferredcites →https://doi.org/10.1016/0377-2217(81)90203-4openalex-snapshot
Facility location in the presence of forbidden regions, I: Formulation and the case of Euclidean distance with one forbidden circle
inferredcites →https://doi.org/10.1016/s0167-5060(08)70332-7openalex-snapshot
Steiner Trees for Ladders
inferredcites →https://doi.org/10.1090/s0002-9939-1985-0810173-6openalex-snapshot
Steiner Minimal Tree for Points on a Circle
inferredcites →https://doi.org/10.1137/0116001openalex-snapshot
Steiner Minimal Trees
inferredcites →https://doi.org/10.1137/0118014openalex-snapshot
On the Efficiency of the Algorithm for Steiner Minimal Trees
inferredcites →https://doi.org/10.1137/0132072openalex-snapshot
The Complexity of Computing Steiner Minimal Trees
inferredcites →https://doi.org/10.1137/0215014openalex-snapshot
On Shortest Paths in Polyhedral Spaces
inferredcites →https://doi.org/10.1137/0217004openalex-snapshot
On the Complexity of Covering Vertices by Faces in a Planar Graph
inferredcites →https://doi.org/10.1145/321724.321733openalex-snapshot
The Generation of Minimal Trees with a Steiner Topology
inferredcites →https://doi.org/10.1145/359156.359164openalex-snapshot
An algorithm for planning collision-free paths among polyhedral obstacles
inferredcites →https://doi.org/10.1287/moor.12.4.634openalex-snapshot
Send-and-Split Method for Minimum-Concave-Cost Network Flows
inferredcites →https://doi.org/10.4153/cmb-1961-016-2openalex-snapshot
On the Problem of Steiner
inferredcites →https://doi.org/10.5957/jsr.1974.18.1.46openalex-snapshot
Minimum-Trajectory Pipe Routing

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.22080openalex-snapshot
Simplifying obstacles for Steiner network problems in the plane
inferred← citeshttps://doi.org/10.1002/net.3230220105openalex-snapshot
Steiner tree problems
inferred← citeshttps://doi.org/10.1007/11602613_27openalex-snapshot
Hardness and Approximation of Octilinear Steiner Trees
inferred← citeshttps://doi.org/10.1007/3-540-48518-x_17openalex-snapshot
Obstacle-Avoiding Euclidean Steiner Trees in the Plane: An Exact Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-13915-9_3openalex-snapshot
Rectilinear Steiner Trees
inferred← citeshttps://doi.org/10.1007/978-3-319-13915-9_4openalex-snapshot
Steiner Trees with Other Cost Functions and Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_14openalex-snapshot
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
inferred← citeshttps://doi.org/10.1007/978-3-540-73951-7_25openalex-snapshot
Steiner Tree in Planar Graphs: An O(nlogn) Approximation Scheme with Singly-Exponential Dependence on Epsilon
inferred← citeshttps://doi.org/10.1007/bf01758763openalex-snapshot
Two new criteria for finding Steiner hulls in Steiner tree problems
inferred← citeshttps://doi.org/10.1007/bf02067240openalex-snapshot
The role of Steiner hulls in the solution to Steiner tree problems
inferred← citeshttps://doi.org/10.1007/bf02067243openalex-snapshot
Steiner minimal trees for three points with one convex polygonal obstacle
inferred← citeshttps://doi.org/10.1007/bf02071979openalex-snapshot
Polynomially solvable special cases of the Steiner problem in planar networks
inferred← citeshttps://doi.org/10.1007/s00373-012-1262-zopenalex-snapshot
The Steiner Problem on Surfaces of Revolution
inferred← citeshttps://doi.org/10.1007/s10898-021-01101-3openalex-snapshot
An exact algorithm for constructing minimum Euclidean skeletons of polygons
inferred← citeshttps://doi.org/10.1016/0020-0190(89)90129-4openalex-snapshot
Shortest enclosing walks and cycles in embedded graphs
inferred← citeshttps://doi.org/10.1016/0166-218x(93)90092-3openalex-snapshot
Euclidean Steiner minimal trees with obstacles and Steiner visibility graphs
inferred← citeshttps://doi.org/10.1016/j.comgeo.2009.01.011openalex-snapshot
A near linear time approximation scheme for Steiner tree among obstacles in the plane
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00256-6openalex-snapshot
Short trees in polygons
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70197-3openalex-snapshot
Chapter 6 Generalizations
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/s0377-2217(99)00131-9openalex-snapshot
Local search for the Steiner tree problem in the Euclidean plane
inferred← citeshttps://doi.org/10.1080/03052159308940971openalex-snapshot
HEURISTIC METHODS FOR THE RECTILINEAR STEINER ARBORESCENCE PROBLEM
inferred← citeshttps://doi.org/10.1080/17517575.2011.594910openalex-snapshot
Multi-terminal pipe routing by Steiner minimal tree and particle swarm optimisation
inferred← citeshttps://doi.org/10.1108/01445151111172952openalex-snapshot
A discrete particle swarm optimization algorithm for rectilinear branch pipe routing
inferred← citeshttps://doi.org/10.1137/1.9781611975482.63openalex-snapshot
Nearly ETH-tight algorithms for P lanar S teiner T ree with Terminals on Few Faces
inferred← citeshttps://doi.org/10.1137/s1052623494271667openalex-snapshot
Shortest Networks for Smooth Curves
inferred← citeshttps://doi.org/10.1142/s021819590700232xopenalex-snapshot
HARDNESS AND APPROXIMATION OF OCTILINEAR STEINER TREES
inferred← citeshttps://doi.org/10.1145/1541885.1541892openalex-snapshot
An O ( n log n ) approximation scheme for Steiner tree in planar graphs
inferred← citeshttps://doi.org/10.1145/3371389openalex-snapshot
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces
inferred← citeshttps://doi.org/10.1145/3449639.3459397openalex-snapshot
A genetic algorithm approach for the Euclidean Steiner tree problem with soft obstacles
inferred← citeshttps://doi.org/10.1287/moor.16.2.310openalex-snapshot
Some Generalized Max-Flow Min-Cut Problems in the Plane
inferred← citeshttps://doi.org/10.21236/ada217744openalex-snapshot
Research in Reliability, Availability and Maintainability for Complex Failure Systems
inferred← citeshttps://doi.org/10.2991/meic-15.2015.61openalex-snapshot
A Survey of Optimization Method for Oil-gas Pipeline Network Layout
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.