Publication:4234114
From MaRDI portal
zbMath0978.68558MaRDI QIDQ4234114
Publication date: 3 February 2002
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
90C27: Combinatorial optimization
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Strong Steiner Tree Approximations in Practice, RNC-approximation algorithms for the steiner problem, Lossy Kernels for Hitting Subgraphs, On the approximability of the Steiner tree problem in phylogeny, Recent results on approximating the Steiner tree problem and its generalizations, On approximate preprocessing for domination and hitting subgraphs with connected deletion sets