Publication:3514991
From MaRDI portal
zbMath1156.90014MaRDI QIDQ3514991
Publication date: 24 July 2008
approximation algorithm; Steiner tree problem; metric space; complexity class; VLSI-design; computer communication network
90C27: Combinatorial optimization
05C12: Distance in graphs
68W25: Approximation algorithms
68Q15: Complexity classes (hierarchies, relations among complexity classes, etc.)
Related Items
The Steiner Problem for Count Matroids, New Valid Inequalities for the Optimal Communication Spanning Tree Problem, Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks, A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem, The Clustered Selected-Internal Steiner Tree Problem, The rainbow vertex-index of complementary graphs, Constrained surface-level gateway placement for underwater acoustic wireless sensor networks, On segmenting logistical zones for servicing continuously developed consumers, Algorithms for the minimum diameter terminal Steiner tree problem, The vertex-rainbow index of a graph, Combinatorial optimization in system configuration design, On two generalized connectivities of graphs, Minimum diameter vertex-weighted Steiner tree, Approximation algorithms for solving the line-capacitated minimum Steiner tree problem, On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs, A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem, On the edge capacitated Steiner tree problem, The minimum size of a graph with given tree connectivity, A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs, Minimum diameter cost-constrained Steiner trees, Euclidean Steiner trees optimal with respect to swapping 4-point subtrees, Steiner trees for hereditary graph classes: a treewidth perspective, A tutorial on the balanced minimum evolution problem, Reliability assessment of the divide-and-swap cube in terms of generalized connectivity, The complexity of determining the vertex-rainbow index of graphs, Approximating minimum Steiner point trees in Minkowski planes
