On the public citation graph
A faster approximation algorithm for the Steiner problem in graphs
0 signed · 105 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.1002/net.3230100207openalex-snapshot
An integer linear programming approach to the steiner problem in graphs
inferredcites →https://doi.org/10.1002/net.3230140112openalex-snapshot
An algorithm for the steiner problem in graphs
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf00288961openalex-snapshot
A fast algorithm for Steiner trees
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
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.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.1145/800113.803626openalex-snapshot
Some NP-complete geometric problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.70040openalex-snapshot
Dynamic Algorithms for Approximate Steiner Trees
inferred← citeshttps://doi.org/10.1002/net.3230190102openalex-snapshot
An SST‐based algorithm for the steiner problem in graphs
inferred← citeshttps://doi.org/10.1002/net.3230260403openalex-snapshot
Computing near‐optimal solutions to the steiner problem in a graph using a genetic algorithm
inferred← citeshttps://doi.org/10.1002/sat.70086openalex-snapshot
Routing and Downlink Resource Allocation for Multicast Traffic in LEO Satellite Constellations
inferred← citeshttps://doi.org/10.1007/3-540-52292-1_14openalex-snapshot
Beyond Steiner's problem: A VLSI oriented generalization
inferred← citeshttps://doi.org/10.1007/3-540-57568-5_285openalex-snapshot
Faster approximation algorithms for the rectilinear steiner tree problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-0255-1_2openalex-snapshot
Genetic Algorithm Approaches to Solve Various Steiner Tree Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0255-1_3openalex-snapshot
Neural Network Approaches to Solve Various Steiner Tree Problems
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_9openalex-snapshot
Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-36987-3_7openalex-snapshot
Round-Message Trade-Off in Distributed Steiner Tree Construction in the CONGEST Model
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_645-1openalex-snapshot
Steiner Tree Problems
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/978-3-540-74742-0_35openalex-snapshot
An Optimal Share Transfer Problem on Secret Sharing Storage Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-05118-0_10openalex-snapshot
A Superstabilizing log(n)-Approximation Algorithm for Dynamic Steiner Trees
inferred← citeshttps://doi.org/10.1007/978-3-642-78910-6_160openalex-snapshot
Steiner Tree Heuristics — A Survey
inferred← citeshttps://doi.org/10.1007/978-981-95-0218-9_9openalex-snapshot
Massively Parallel Approximate Steiner Tree Algorithms
inferred← citeshttps://doi.org/10.1007/bf00264613openalex-snapshot
On efficient implementation of an approximation algorithm for the Steiner tree problem
inferred← citeshttps://doi.org/10.1007/bf01193338openalex-snapshot
Efficient solutions to multicast routing in communication networks
inferred← citeshttps://doi.org/10.1007/bf01553886openalex-snapshot
Fast heuristic algorithms for rectilinear steiner trees
inferred← citeshttps://doi.org/10.1007/bf01758765openalex-snapshot
Path-distance heuristics for the Steiner problem in undirected networks
inferred← citeshttps://doi.org/10.1007/bf02071982openalex-snapshot
The multi-weighted Steiner tree problem
inferred← citeshttps://doi.org/10.1007/bf02073942openalex-snapshot
Branch-and-bound as a higher-order function
inferred← citeshttps://doi.org/10.1007/bfb0016276openalex-snapshot
Near optimal algorithms for finding minimum Steiner trees on random graphs
inferred← citeshttps://doi.org/10.1007/pl00009310openalex-snapshot
Faster Approximation Algorithms for the Rectilinear Steiner Tree Problem
inferred← citeshttps://doi.org/10.1007/s002360000042openalex-snapshot
The class Steiner minimal tree problem: a lower bound and test problem generation
inferred← citeshttps://doi.org/10.1007/s004539910005openalex-snapshot
On Exact Solutions for the Rectilinear Steiner Tree Problem Part I: Theoretical Results
inferred← citeshttps://doi.org/10.1007/s10107-016-0987-5openalex-snapshot
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90066-xopenalex-snapshot
A faster approximation algorithm for the Steiner problem in graphs
inferred← citeshttps://doi.org/10.1016/0020-0255(93)90128-9openalex-snapshot
The steiner problem in distributed computing systems
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90021-2openalex-snapshot
Steiner's problem in graphs: heuristic methods
inferred← citeshttps://doi.org/10.1016/0166-218x(92)90151-yopenalex-snapshot
Heuristics for the Steiner problem in graphs
inferred← citeshttps://doi.org/10.1016/0167-9260(88)90017-xopenalex-snapshot
Optimal two-terminal α-β wire routing
inferred← citeshttps://doi.org/10.1016/0305-0548(90)90045-9openalex-snapshot
The algorithmic structure of a decision support system for a design of a district heating network
inferred← citeshttps://doi.org/10.1016/j.jpdc.2021.08.004openalex-snapshot
Improved distributed approximation for Steiner tree in the CONGEST model
inferred← citeshttps://doi.org/10.1016/j.jpdc.2023.104717openalex-snapshot
Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs
inferred← citeshttps://doi.org/10.1016/j.tcs.2013.07.003openalex-snapshot
A super-stabilizing log(n) -approximation algorithm for dynamic Steiner trees
inferred← citeshttps://doi.org/10.1016/s0305-0548(98)00075-6openalex-snapshot
Optimum multicast of multimedia streams
inferred← citeshttps://doi.org/10.1038/s44335-024-00015-zopenalex-snapshot
Computing with oscillators from theoretical underpinnings to applications and demonstrators
inferred← citeshttps://doi.org/10.1090/dimacs/043/08openalex-snapshot
Greedy randomized adaptive search procedures for the Steiner problem in graphs
inferred← citeshttps://doi.org/10.1093/ietfec/e90-a.11.2458openalex-snapshot
An Optimal Share Transfer Problem on Secret Sharing Storage Systems
inferred← citeshttps://doi.org/10.1098/rsta.1998.0201openalex-snapshot
Pyrometallurgical significance of Marangoni flow: mechanism and contributions to processing
inferred← citeshttps://doi.org/10.1109/43.137519openalex-snapshot
Provably good performance-driven global routing
inferred← citeshttps://doi.org/10.1109/43.875292openalex-snapshot
A new heuristic for rectilinear Steiner trees
inferred← citeshttps://doi.org/10.1109/access.2025.3526722openalex-snapshot
PAGR: Accelerating Global Routing for VLSI Design Flow
inferred← citeshttps://doi.org/10.1109/candar.2019.00018openalex-snapshot
2(1 – 1/ℓ)-Factor Steiner Tree Approximation in Õ(n^1/3) Rounds in the CONGESTED CLIQUE
inferred← citeshttps://doi.org/10.1109/candar60563.2023.00030openalex-snapshot
An Incremental Algorithm for (2-ε)-Approximate Steiner Tree Requiring O(n) Update Time
inferred← citeshttps://doi.org/10.1109/edac.1991.206400openalex-snapshot
Mickey: a macro cell global router
inferred← citeshttps://doi.org/10.1109/glsv.1992.218344openalex-snapshot
The Steiner tree problem with minimum number of vertices in graphs
inferred← citeshttps://doi.org/10.1109/icc.1994.368828openalex-snapshot
A fast algorithm for improved RS Steiner tree heuristic in multipoint routing
inferred← citeshttps://doi.org/10.1109/iccad.1989.76913openalex-snapshot
Combining partitioning and global routing in sea-of-cells design
inferred← citeshttps://doi.org/10.1109/iccad.1999.810641openalex-snapshot
A new heuristic for rectilinear Steiner trees
inferred← citeshttps://doi.org/10.1109/icccn.1995.540186openalex-snapshot
On multicasting in a communication network
inferred← citeshttps://doi.org/10.1109/icci.1993.315344openalex-snapshot
A parallel algorithm for the Steiner tree problem
inferred← citeshttps://doi.org/10.1109/ipdps53621.2022.00060openalex-snapshot
Towards Distributed 2-Approximation Steiner Minimal Trees in Billion-edge Graphs
inferred← citeshttps://doi.org/10.1109/iraniancee.2012.6292435openalex-snapshot
A heuristic algorithm for solving Steiner tree problem on urban traffic network
inferred← citeshttps://doi.org/10.1109/iscas.1992.230514openalex-snapshot
Provably good algorithms for performance-driven global routing
inferred← citeshttps://doi.org/10.1109/jiot.2023.3305030openalex-snapshot
Complete Area ϵ-Probability Coverage in Solar Insecticidal Lamps Internet of Things
inferred← citeshttps://doi.org/10.1109/lcn.1995.527370openalex-snapshot
Optimal multicast routing for ATM networks
inferred← citeshttps://doi.org/10.1109/newcas.2004.1359038openalex-snapshot
Performance of probabilistic approaches to Steiner tree problem
inferred← citeshttps://doi.org/10.1109/soac.1990.82156openalex-snapshot
A statistical mechanics approach to the directed Steiner problem on networks
inferred← citeshttps://doi.org/10.1109/tc.1987.1676904openalex-snapshot
Rectilinear Shortest Paths and Minimum Spanning Trees in the Presence of Rectilinear Obstacles
inferred← citeshttps://doi.org/10.1109/tcad.2010.2096571openalex-snapshot
FOARS: FLUTE Based Obstacle-Avoiding Rectilinear Steiner Tree Construction
inferred← citeshttps://doi.org/10.1137/s0097539792229672openalex-snapshot
Rectilinear Path Problems among Rectilinear Obstacles Revisited
inferred← citeshttps://doi.org/10.1142/s0129054102001527openalex-snapshot
THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM
inferred← citeshttps://doi.org/10.1142/s0129054120500367openalex-snapshot
Distributed Approximation Algorithms for Steiner Tree in the CONGESTED CLIQUE
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/168173.168420openalex-snapshot
A test problem generator for the Steiner problem in graphs
inferred← citeshttps://doi.org/10.1145/2831235openalex-snapshot
The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs
inferred← citeshttps://doi.org/10.1145/3288599.3288629openalex-snapshot
A simple 2(1-1/ l ) factor distributed approximation algorithm for steiner tree in the CONGEST model
inferred← citeshttps://doi.org/10.1145/3757376.3771386openalex-snapshot
Steiner Traversal Initialization: Optimizing the Initial Curve for Geometric Flow-based Surface Filling
inferred← citeshttps://doi.org/10.1177/1748301816640714openalex-snapshot
A Steiner point candidate-based heuristic framework for the Steiner tree problem in graphs
inferred← citeshttps://doi.org/10.1201/9781420013481-24openalex-snapshot
Minimum Steiner Tree Construction *
inferred← citeshttps://doi.org/10.1609/aaai.v36i8.20854openalex-snapshot
Learning-Augmented Algorithms for Online Steiner Tree
inferred← citeshttps://doi.org/10.18653/v1/2022.csrr-1.1openalex-snapshot
Identifying relevant common sense information in knowledge graphs
inferred← citeshttps://doi.org/10.21711/231766362020/rmc4628openalex-snapshot
An algorithmic strategy to select vertices as router candidates in a Steiner tree
inferred← citeshttps://doi.org/10.31274/etd-180810-2776openalex-snapshot
Obstacle-Avoiding Rectilinear Steiner Minimal Tree Construction
inferred← citeshttps://doi.org/10.3390/ijms161226148openalex-snapshot
Bioinformatics Mining and Modeling Methods for the Identification of Disease Mechanisms in Neurodegenerative Disorders
inferred← citeshttps://doi.org/10.3390/s16091372openalex-snapshot
Target Coverage in Wireless Sensor Networks with Probabilistic Sensors
inferred← citeshttps://doi.org/10.4230/lipics.stacs.2013.353openalex-snapshot
Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1310.2494openalex-snapshot
Algorithmes auto-stabilisants pour la construction d'arbres couvrants et la gestion d'entités autonomes
inferred← citeshttps://doi.org/10.48550/arxiv.1907.12011openalex-snapshot
Distributed Approximation Algorithms for Steiner Tree in the $\mathcal{CONGESTED}$ $\mathcal{CLIQUE}$
inferred← citeshttps://doi.org/10.52825/zukunftsnetz.v2i.2588openalex-snapshot
Development of a Methodology for Heating Network Planning to be Considered in Electricity Network Planning
inferred← citeshttps://doi.org/10.5555/198174.198256openalex-snapshot
An architecture-independent approach to FPGA routing based on multi-weighted graphs
inferred← citeshttps://doi.org/10.5555/951513.951567openalex-snapshot
Mickey: a macro cell global router
inferred← citeshttps://doi.org/10.5753/etc.2018.3171openalex-snapshot
Uma estratégia para selecionar vértices como candidatos a roteadores em uma árvore de Steiner
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.