On the public citation graph
Generalized steiner problem in outerplanar networks
0 signed · 30 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/j.1538-7305.1957.tb01515.xopenalex-snapshot
Shortest Connection Networks And Some Generalizations
inferredcites →https://doi.org/10.1002/net.3230010203openalex-snapshot
Steiner's problem in graphs and its implications
inferredcites →https://doi.org/10.1002/net.3230130202openalex-snapshot
Steiner trees, partial 2–trees, and minimum IFI networks
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.1109/tct.1964.1082356openalex-snapshot
Bi-Path Networks and Multicommodity Flows
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1145/322154.322155openalex-snapshot
Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs
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.20072openalex-snapshot
Design of Survivable Networks: A survey
inferred← citeshttps://doi.org/10.1002/net.3230170203openalex-snapshot
Steiner problem in networks: A survey
inferred← citeshttps://doi.org/10.1007/3-540-19487-8_28openalex-snapshot
Independent covers in outerplanar graphs
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_15openalex-snapshot
Polyhedral Approaches to the Design of Survivable Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-04618-7_1openalex-snapshot
Minimum Diameter k-Steiner Forest
inferred← citeshttps://doi.org/10.1007/bf01758767openalex-snapshot
Problems with generalized steiner problems
inferred← citeshttps://doi.org/10.1007/bf01932134openalex-snapshot
In-trees and plane embeddings of outerplanar graphs
inferred← citeshttps://doi.org/10.1007/bf02109865openalex-snapshot
The design of survivable directed networks
inferred← citeshttps://doi.org/10.1007/s10479-024-06123-0openalex-snapshot
Extended formulation and Branch-and-Cut-and-Price algorithm for the two connected subgraph problem with disjunctive constraints
inferred← citeshttps://doi.org/10.1016/0196-6774(86)90018-0openalex-snapshot
Generalized steiner problem in series-parallel networks
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.12.012openalex-snapshot
A 2-approximation algorithm and beyond for the minimum diameter k-Steiner forest problem
inferred← citeshttps://doi.org/10.1016/s0167-5060(08)70203-6openalex-snapshot
Chapter 6 Generalizations
inferred← citeshttps://doi.org/10.1016/s0927-0507(05)80127-6openalex-snapshot
Chapter 10 Design of survivable networks
inferred← citeshttps://doi.org/10.1109/tr.1986.4335425openalex-snapshot
Maximizing the Mean Number of Communicating Vertex Pairs in Series-Parallel Networks
inferred← citeshttps://doi.org/10.1137/050639600openalex-snapshot
On the Polytope of the (1,2)-Survivable Network Design Problem
inferred← citeshttps://doi.org/10.1137/s0097539792236237openalex-snapshot
When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
inferred← citeshttps://doi.org/10.1145/195058.195422openalex-snapshot
Random sampling in cut, flow, and network design problems
inferred← citeshttps://doi.org/10.1287/moor.24.2.383openalex-snapshot
Random Sampling in Cut, Flow, and Network Design 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.