S. Guha, A. Meyerson, K. Munagala. A Constant Factor Approximation for the Single Source Edge Installation Problem. 33rd ACM STOC, 2001, pp 383--388. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Group Strategyproof Mechanisms via Primal-Dual Algorithms - Pal, Tardos (2003) (8 citations) (Correct)
....of Jain and Vazirani [20] and the currently best, 1. 52 approximation algorithm of Mahdian et al. 26] The first constant factor approximation algorithm for the Single Source Rent or Buy Network Design problem is due to Karger and Minkoff [23] and Guha, Meyerson and Munagala [16] see also [17]) Both algorithms use a variant of facility location to gather the clients, and then build a Steiner tree on the set of gathering points. Swamy and Kumar [32] gave a primal dual 4.55 approximation algorithm, that is also built analogously as a 2 stage algorithm (gathering followed by a Steiner ....
S. Guha, A. Meyerson, K. Munagala. A Constant Factor Approximation for the Single Source Edge Installation Problem. 33rd Annual ACM Symposium on the Theory of Computing, (2001), pp 383--388.
Group Strategyproof Mechanisms via Primal-Dual Algorithms - Pal, Tardos (2003) (8 citations) (Correct)
No context found.
S. Guha, A. Meyerson, K. Munagala. A Constant Factor Approximation for the Single Source Edge Installation Problem. 33rd ACM STOC, 2001, pp 383--388.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC