A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
A nearly best-possible approximation algorithm for node-weighted Steiner trees
Journal of Algorithms
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Bicriteria network design problems
Journal of Algorithms
Efficient recovery from power outage (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The budgeted maximum coverage problem
Information Processing Letters
The prize collecting Steiner tree problem: theory and practice
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
The Constrained Minimum Spanning Tree Problem (Extended Abstract)
SWAT '96 Proceedings of the 5th Scandinavian Workshop on Algorithm Theory
Saving an epsilon: a 2-approximation for the k-MST problem in graphs
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
The prize-collecting generalized steiner tree problem via a new approach of primal-dual schema
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Approximation Algorithms for Constrained Node Weighted Steiner Tree Problems
SIAM Journal on Computing
| Hi-index | 0.00 |
We consider an optimization problem consisting of an undirected graph, with cost and profit functions defined on all vertices. The goal is to find a connected subset of vertices with maximum total profit, whose total cost does not exceed a given budget. The best result known prior to this work guaranteed a (2,O(logn)) bicriteria approximation, i.e. the solution's profit is at least a fraction of $\frac{1}{O(\log n)}$ of an optimum solution respecting the budget, while its cost is at most twice the given budget. We improve these results and present a bicriteria tradeoff that, given any 茂戮驴茂戮驴 (0,1], guarantees a $(1+\varepsilon,O(\frac{1}{\varepsilon}\log n))$-approximation.