On multiple steiner subgraph problems

DOI10.1002/NET.3230160408MaRDI QIDQ3786300zbMATH OpenOpenAlexFDO

Authors Michael B. Richey, R. G. Parker

Publication date 1986

Published in Networks (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/net.3230160408

zbMATH Keywords

NP-completeseries-parallel graphsSteiner subgraph-like problems

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Programming involving graphs or networks (90C35)

Recommendations

• Generalized steiner problem in series-parallel networks
• Publication:4945799
• The Steiner forest problem revisited
• A PTAS for weight constrained Steiner trees in series--parallel graphs.
• scientific article; zbMATH DE number 1796994

Cited in

(11)

• Algorithms for recognition of regular properties and decomposition of recursive graph families
• Problems with generalized Steiner problems
• Comparison of formulations and a heuristic for packing Steiner trees in a graph
• An effective genetic algorithm for network coding
• Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
• Placing Green bridges optimally, with a multivariate analysis
• Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem
• scientific article; zbMATH DE number 1424550 (Why is no real title available?)
• Placing green bridges optimally, with a multivariate analysis
• A cubic algorithm for the directed Eulerian subgraph problem
• The Steiner forest problem revisited

This page was built for publication: On multiple steiner subgraph problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3786300)