scientific article

zbMath1156.90014MaRDI QIDQ3514991

Xiao-Dong Hu, Ding-Zhu Du

Publication date: 24 July 2008

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximation algorithmSteiner tree problemmetric spacecomplexity classVLSI-designcomputer communication network

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Distance in graphs (05C12) Approximation algorithms (68W25) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)

Related Items (27)

The Steiner Problem for Count Matroids ⋮ The rainbow vertex-index of complementary graphs ⋮ Steiner trees for hereditary graph classes: a treewidth perspective ⋮ On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs ⋮ A sharp lower bound for the generalized 3-edge-connectivity of strong product graphs ⋮ A tutorial on the balanced minimum evolution problem ⋮ Min‐sum controllable risk problems with concave risk functions of the same value range ⋮ Reliability assessment of the divide-and-swap cube in terms of generalized connectivity ⋮ A massively parallel branch-\&-bound algorithm for the balanced minimum evolution problem ⋮ The Clustered Selected-Internal Steiner Tree Problem ⋮ On two generalized connectivities of graphs ⋮ A 2-approximation algorithm and beyond for the minimum diameter \(k\)-Steiner forest problem ⋮ Minimum diameter cost-constrained Steiner trees ⋮ Constrained surface-level gateway placement for underwater acoustic wireless sensor networks ⋮ On segmenting logistical zones for servicing continuously developed consumers ⋮ On the edge capacitated Steiner tree problem ⋮ Euclidean Steiner trees optimal with respect to swapping 4-point subtrees ⋮ New Valid Inequalities for the Optimal Communication Spanning Tree Problem ⋮ The minimum size of a graph with given tree connectivity ⋮ Algorithms for the minimum diameter terminal Steiner tree problem ⋮ The complexity of determining the vertex-rainbow index of graphs ⋮ Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks ⋮ The vertex-rainbow index of a graph ⋮ Approximating minimum Steiner point trees in Minkowski planes ⋮ Minimum diameter vertex-weighted Steiner tree ⋮ Combinatorial optimization in system configuration design ⋮ Approximation algorithms for solving the line-capacitated minimum Steiner tree problem

This page was built for publication: