Publication:4952636
From MaRDI portal
zbMath0956.68109MaRDI QIDQ4952636
Publication date: 2000
68R10: Graph theory (including graph drawing) in computer science
Related Items
Approximation algorithms for the covering Steiner problem, A tight bound on approximating arbitrary metrics by tree metrics, The polymatroid Steiner problems, A greedy approximation algorithm for the group Steiner problem