On multiple steiner subgraph problems
From MaRDI portal
Publication:3786300
DOI10.1002/net.3230160408zbMath0643.90091OpenAlexW2129845900MaRDI QIDQ3786300
Michael B. Richey, R. Gary Parker
Publication date: 1986
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230160408
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27)
Related Items
Comparison of formulations and a heuristic for packing Steiner trees in a graph, Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs, Algorithms for recognition of regular properties and decomposition of recursive graph families, Problems with generalized Steiner problems, Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem, An effective genetic algorithm for network coding, The Steiner forest problem revisited, A cubic algorithm for the directed Eulerian subgraph problem, Placing Green bridges optimally, with a multivariate analysis
Cites Work
