On the public citation graph

Problems with generalized steiner problems

https://doi.org/10.1007/bf01758767
0 signed · 22 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.3230130202openalex-snapshot
Steiner trees, partial 2–trees, and minimum IFI networks
inferredcites →https://doi.org/10.1002/net.3230150109openalex-snapshot
Steiner trees, connected domination and strongly chordal graphs
inferredcites →https://doi.org/10.1002/net.3230160408openalex-snapshot
On multiple steiner subgraph problems
inferredcites →https://doi.org/10.1007/3-540-19488-6_110openalex-snapshot
Dynamic programming on graphs with bounded treewidth
inferredcites →https://doi.org/10.1007/bf01935369openalex-snapshot
Generalized steiner problem in outerplanar networks
inferredcites →https://doi.org/10.1016/0022-0000(86)90018-8openalex-snapshot
Chordality properties on graphs and minimal conceptual connections in semantic data models
inferredcites →https://doi.org/10.1016/0166-218x(87)90031-xopenalex-snapshot
Steiner problem in Halin networks
inferredcites →https://doi.org/10.1016/0196-6774(85)90012-4openalex-snapshot
The NP-completeness column: an ongoing guide
inferredcites →https://doi.org/10.1016/0196-6774(86)90018-0openalex-snapshot
Generalized steiner problem in series-parallel networks
inferredcites →https://doi.org/10.1016/0196-6774(86)90020-9openalex-snapshot
The NP-completeness column: An ongoing guide
inferredcites →https://doi.org/10.1016/0304-3975(87)90067-3openalex-snapshot
The NP-completeness of steiner tree and dominating set for chordal bipartite graphs
inferredcites →https://doi.org/10.1145/322326.322328openalex-snapshot
Linear-time computability of combinatorial problems on series-parallel graphs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1016/s0140-3664(02)00132-9openalex-snapshot
A survey of optical multicast over WDM networks
inferred← citeshttps://doi.org/10.1109/50.908667openalex-snapshot
Cost-effective implementation of multicasting in wavelength-routed networks
inferred← citeshttps://doi.org/10.1109/65.819175openalex-snapshot
Multicast routing algorithms and protocols: a tutorial
inferred← citeshttps://doi.org/10.1109/hsnmc.2002.1032598openalex-snapshot
A genetic algorithm for the degree-constrained multicasting problem
inferred← citeshttps://doi.org/10.1109/ictel.2003.1191206openalex-snapshot
Construction of light-trees for WDM multicasting under splitting capability constraints
inferred← citeshttps://doi.org/10.1109/infcom.1995.515897openalex-snapshot
Degree-constrained multicasting in point-to-point networks
inferred← citeshttps://doi.org/10.1109/lcn.2002.1181830openalex-snapshot
An expanded graph model for MCRWA problem in WDM networks
inferred← citeshttps://doi.org/10.1117/12.634310openalex-snapshot
A degree-constrained multicast routing algorithm for multimedia communications
inferred← citeshttps://doi.org/10.1145/1374376.1374485openalex-snapshot
Additive approximation for bounded degree survivable network design
inferred← citeshttps://doi.org/10.3390/math12223521openalex-snapshot
Degree-Constrained Steiner Problem in Graphs with Capacity Constraints
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.