Publication:5692514
From MaRDI portal
zbMath1179.90277MaRDI QIDQ5692514
Yingshu Li, Xiuzhen Cheng, Ding-Zhu Du, Hung Quang Ngo
Publication date: 28 September 2005
Related Items
Improved Approximation Algorithms for (Budgeted) Node-weighted Steiner Problems, Constructing Internally Disjoint Pendant Steiner Trees in Cartesian Product Networks, Implications, conflicts, and reductions for Steiner trees, Implications, conflicts, and reductions for Steiner trees, A degree based approach to find Steiner trees, Directed Steiner trees with diffusion costs, A practical greedy approximation for the directed Steiner tree problem, The vertex-rainbow index of a graph, A better constant-factor approximation for selected-internal Steiner minimum tree, Exploring the constrained maximum edge-weight connected graph problem, A robust and scalable algorithm for the Steiner problem in graphs, 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