On the public citation graph
The Performance of greedy algorithms for the on-line steiner tree and related problems
0 signed · 39 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.3230090103openalex-snapshot
The largest minimal rectilinear steiner trees for a set of n points enclosed in a rectangle with given perimeter
inferredcites →https://doi.org/10.1002/net.3230170203openalex-snapshot
Steiner problem in networks: A survey
inferredcites →https://doi.org/10.1006/jcss.1995.1073openalex-snapshot
Competitive Algorithms for Distributed Data Management
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf00149359openalex-snapshot
On Steiner trees for bounded point sets
inferredcites →https://doi.org/10.1007/bf01949715openalex-snapshot
Cost-minimal trees in directed acyclic graphs
inferredcites →https://doi.org/10.1007/bf02612335openalex-snapshot
A dual ascent approach for steiner tree problems on a directed graph
inferredcites →https://doi.org/10.1016/0305-0483(76)90027-xopenalex-snapshot
The simple plant location problem
inferredcites →https://doi.org/10.1016/0377-2217(83)90181-9openalex-snapshot
The simple plant location problem: Survey and synthesis
inferredcites →https://doi.org/10.1016/0378-4754(86)90100-xopenalex-snapshot
Combinatorial optimization: Annotated bibliographies.
inferredcites →https://doi.org/10.1016/s0304-0208(08)73236-5openalex-snapshot
The Steiner Problem in Graphs
inferredcites →https://doi.org/10.1112/s0025579300000784openalex-snapshot
The shortest path and the shortest road through n points
inferredcites →https://doi.org/10.1137/0114025openalex-snapshot
On Steiner’s Problem with Rectilinear Distance
inferredcites →https://doi.org/10.1137/s0097539792236237openalex-snapshot
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
inferredcites →https://doi.org/10.1145/100216.100268openalex-snapshot
On the power of randomization in online algorithms
inferredcites →https://doi.org/10.1145/129712.129717openalex-snapshot
Competitive algorithms for distributed data management (extended abstract)
inferredcites →https://doi.org/10.1145/141914.990672openalex-snapshot
Book Review: Introduction to Parallel Algorithms and Architectures : Arrays, Trees, Hypercubes by F. T. Leighton (Morgan Kauffman Pub, 1992)
inferredcites →https://doi.org/10.1145/142675.142744openalex-snapshot
On-line Steiner trees in the Euclidean plane
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.20057openalex-snapshot
The sequential sum problem and performance bounds on the greedy algorithm for the on‐line Steiner problem
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-319-51741-4_11openalex-snapshot
Non-greedy Online Steiner Trees on Outerplanar Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-62127-2_15openalex-snapshot
A Deterministic Algorithm for Online Steiner Tree Leasing
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_7openalex-snapshot
A Near-Tight Bound for the Online Steiner Tree Problem in Graphs of Bounded Asymmetry
inferred← citeshttps://doi.org/10.1007/978-3-642-03367-4_4openalex-snapshot
Online Priority Steiner Tree Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-12450-1_1openalex-snapshot
On the Competitiveness of the Online Asymmetric and Euclidean Steiner Tree Problems
inferred← citeshttps://doi.org/10.1007/s00224-019-09922-2openalex-snapshot
Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems
inferred← citeshttps://doi.org/10.1007/s00450-011-0150-8openalex-snapshot
Migrating and replicating data in networks
inferred← citeshttps://doi.org/10.1007/s00453-020-00768-6openalex-snapshot
Non-Greedy Online Steiner Trees on Outerplanar Graphs
inferred← citeshttps://doi.org/10.1016/0020-0190(95)00000-3openalex-snapshot
Linear bounds for on-line Steiner problems
inferred← citeshttps://doi.org/10.1137/1.9781611977073.125openalex-snapshot
An Improved Analysis of Greedy for Online Steiner Forest
inferred← citeshttps://doi.org/10.1137/s0097539795287824openalex-snapshot
Competitive On-Line Algorithms for Distributed Data Management
inferred← citeshttps://doi.org/10.1142/s0129054102001527openalex-snapshot
THE EFFECT OF ASYMMETRY ON THE ON-LINE MULTICAST ROUTING PROBLEM
inferred← citeshttps://doi.org/10.14279/depositonce-3125openalex-snapshot
The Power of Recourse in Online Optimization: Robust Solutions for Scheduling, Matroid and MST Problems
inferred← citeshttps://doi.org/10.4230/dagsemproc.09171.3openalex-snapshot
Parameterized Analysis of Online Steiner Tree 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.