On the public citation graph
Cost-minimal trees in directed acyclic graphs
0 signed · 54 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.3230010203openalex-snapshot
Steiner's problem in graphs and its implications
inferredcites →https://doi.org/10.1016/0025-5564(68)90043-6openalex-snapshot
Clustering in numerical cladistics: A minimum-length directed tree problem
inferredcites →https://doi.org/10.1093/oso/9780195105193.001.0001openalex-snapshot
What Is Mathematics?
inferredcites →https://doi.org/10.1111/j.1558-5646.1965.tb01722.xopenalex-snapshot
A METHOD FOR DEDUCING BRANCHING SEQUENCES IN PHYLOGENY
inferredcites →https://doi.org/10.1137/0114025openalex-snapshot
On Steiner’s Problem with Rectilinear Distance
inferredcites →https://doi.org/10.1137/1009031openalex-snapshot
Integer Programming by Implicit Enumeration and Balas’ Method
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.13.4.517openalex-snapshot
An Additive Algorithm for Solving Linear Programs with Zero-One Variables
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.3230100207openalex-snapshot
An integer linear programming approach to the steiner problem in graphs
inferred← citeshttps://doi.org/10.1002/net.3230140112openalex-snapshot
An algorithm for the steiner problem in graphs
inferred← citeshttps://doi.org/10.1002/net.3230170107openalex-snapshot
Problem reduction methods and a tree generation algorithm for the steiner network problem
inferred← citeshttps://doi.org/10.1002/net.3230170203openalex-snapshot
Steiner problem in networks: A survey
inferred← citeshttps://doi.org/10.1007/3-540-57155-8_285openalex-snapshot
Greedy algorithms for the on-line steiner tree and generalized steiner problems
inferred← citeshttps://doi.org/10.1007/3-540-61332-3_135openalex-snapshot
Steiner problems on directed acyclic graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-53262-8_20openalex-snapshot
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-17801-5_35openalex-snapshot
The Rectilinear Steiner Forest Arborescence
inferred← citeshttps://doi.org/10.1007/978-3-642-20807-2_30openalex-snapshot
A Layered Graph Model and an Adaptive Layers Framework to Solve Delay-Constrained Minimum Tree Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-45030-3_67openalex-snapshot
Approximating the Generalized Minimum Manhattan Network Problem
inferred← citeshttps://doi.org/10.1007/978-3-662-43951-7_44openalex-snapshot
Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems
inferred← citeshttps://doi.org/10.1007/978-3-662-47666-6_54openalex-snapshot
Optimal Competitiveness for the Rectilinear Steiner Arborescence Problem
inferred← citeshttps://doi.org/10.1007/bf01185867openalex-snapshot
The Performance of greedy algorithms for the on-line steiner tree and related problems
inferred← citeshttps://doi.org/10.1007/bf01758762openalex-snapshot
The rectilinear steiner arborescence problem
inferred← citeshttps://doi.org/10.1007/bf02523690openalex-snapshot
A series of approximation algorithms for the acyclic directed steiner tree problem
inferred← citeshttps://doi.org/10.1007/s00453-017-0298-0openalex-snapshot
Approximating the Generalized Minimum Manhattan Network Problem
inferred← citeshttps://doi.org/10.1007/s00453-021-00868-xopenalex-snapshot
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem
inferred← citeshttps://doi.org/10.1007/s10878-005-5487-0openalex-snapshot
Two Variations of the Minimum Steiner Problem
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00000-3openalex-snapshot
Linear bounds for on-line Steiner problems
inferred← citeshttps://doi.org/10.1016/0377-2217(82)90111-4openalex-snapshot
Optimal implementation of selectors in a data-base
inferred← citeshttps://doi.org/10.1016/s0022-5193(74)80009-3openalex-snapshot
An improved solution to the generalized camin-sokal model for numerical cladistics
inferred← citeshttps://doi.org/10.1016/s0166-218x(03)00445-1openalex-snapshot
Delay-related secondary objectives for rectilinear Steiner minimum trees
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70203-6openalex-snapshot
Chapter 6 Generalizations
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70207-3openalex-snapshot
Chapter 4 Generalizations
inferred← citeshttps://doi.org/10.1016/s0304-0208(08)73236-5openalex-snapshot
The Steiner Problem in Graphs
inferred← citeshttps://doi.org/10.1023/a:1009826311973openalex-snapshot
Polynomial Time Approximation Scheme for the Rectilinear Steiner Arborescence Problem
inferred← citeshttps://doi.org/10.1057/jors.1993.69openalex-snapshot
Solving the Graphical Steiner Tree Problem Using Genetic Algorithms
inferred← citeshttps://doi.org/10.1080/03052159308940971openalex-snapshot
HEURISTIC METHODS FOR THE RECTILINEAR STEINER ARBORESCENCE PROBLEM
inferred← citeshttps://doi.org/10.1109/43.673630openalex-snapshot
Efficient algorithms for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design
inferred← citeshttps://doi.org/10.1109/bibm.2010.5706536openalex-snapshot
Structural parsimony: Reductions in sequence space
inferred← citeshttps://doi.org/10.1109/dac.2018.8465902openalex-snapshot
Exact Algorithms for Delay-Bounded Steiner Arborescences
inferred← citeshttps://doi.org/10.1109/icccn.2010.5560113openalex-snapshot
Redundancy-Aware Routing with Limited Resources
inferred← citeshttps://doi.org/10.1109/iscas.1997.621429openalex-snapshot
Fast optimal algorithms for the minimum rectilinear Steiner arborescence problem
inferred← citeshttps://doi.org/10.1109/iscas56072.2025.11043717openalex-snapshot
A Pseudo-Boolean Encoding Method for Rectilinear Steiner Arborescence in VLSI Routing
inferred← citeshttps://doi.org/10.1109/tcad.2003.814249openalex-snapshot
New approximations for the rectilinear steiner arborescence problem
inferred← citeshttps://doi.org/10.1109/tcad.2019.2894653openalex-snapshot
SALT: Provably Good Routing Topology by a Novel Steiner Shallow-Light Tree Algorithm
inferred← citeshttps://doi.org/10.1145/267665.267695openalex-snapshot
Efficient heuristics for the minimum shortest path Steiner arborescence problem with applications to VLSI physical design
inferred← citeshttps://doi.org/10.1145/3381420openalex-snapshot
Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems
inferred← citeshttps://doi.org/10.1145/967900.968100openalex-snapshot
Two hybrid evolutionary algorithms for the rectilinear Steiner arborescence problem
inferred← citeshttps://doi.org/10.1201/9781420013481-25openalex-snapshot
Timing-Driven Interconnect Synthesis
inferred← citeshttps://doi.org/10.1287/trsc.32.2.174openalex-snapshot
Optimizing Auto-Carrier Loading
inferred← citeshttps://doi.org/10.5555/338219.338639openalex-snapshot
The rectilinear Steiner arborescence problem is NP-complete
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.