scientific article; zbMATH DE number 2209521

zbMath1179.90277MaRDI QIDQ5692514

Yingshu Li, Xiuzhen Cheng, Ding-Zhu Du, Hung Quang Ngo

Publication date: 28 September 2005

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (16)

A better constant-factor approximation for selected-internal Steiner minimum tree ⋮ A degree based approach to find Steiner trees ⋮ A robust and scalable algorithm for the Steiner problem in graphs ⋮ Directed Steiner trees with diffusion costs ⋮ A practical greedy approximation for the directed Steiner tree problem ⋮ Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems ⋮ Swap-vertex based neighborhood for Steiner tree problems ⋮ The minimum size of a graph with given tree connectivity ⋮ On the history of the Euclidean Steiner tree problem ⋮ The Euclidean bottleneck full 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 ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ Implications, conflicts, and reductions for Steiner trees ⋮ Exploring the constrained maximum edge-weight connected graph problem

This page was built for publication: