Approximating the weight of shallow Steiner trees
- 20 July 1999
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 93 (2-3), 265-285
- https://doi.org/10.1016/s0166-218x(99)00111-0
Abstract
No abstract availableKeywords
This publication has 22 references indexed in Scilit:
- Bicriteria Network Design ProblemsJournal of Algorithms, 1998
- Balancing minimum spanning trees and shortest-path treesAlgorithmica, 1995
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner TreesJournal of Algorithms, 1995
- Generating Sparse 2-SpannersJournal of Algorithms, 1994
- On the hardness of approximating minimization problemsJournal of the ACM, 1994
- Compression of correlated bit-vectorsInformation Systems, 1991
- Routing to Multiple Destinations in Computer NetworksIEEE Transactions on Communications, 1983
- An analysis of the greedy algorithm for the submodular set covering problemCombinatorica, 1982
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974