Approximation Algorithms for Connected Dominating Sets (1996)

Cached

Download Links

by Sudipto Guha , Samir Khuller
Venue:Algorithmica
Citations:276 - 9 self

Active Bibliography

© 1998 Springer-Verlag New York Inc. Approximation Algorithms for Connected Dominating Sets 1 – S. Guha, S. Khuller
68 Improved Methods for Approximating Node Weighted Steiner Trees and Connected Dominating Sets – Sudipto Guha, Samir Khuller Y - 1999
143 Approximation Algorithms for Directed Steiner Problems – Moses Charikar, Chandra Chekuri, To-yat Cheung, Zuo Dai, Ashish Goel, Sudipto Guha, Ming Li - 1998
3 Steiner Trees and Beyond: Approximation Algorithms for Network Design – Ramamurthy Ravi - 1993
1 A Genetic Algorithm Applied to Graph Problems Involving Subsets of Vertices – Yaser Alkhalifah, Roger L. Wainwright
147 Geometric Shortest Paths and Network Optimization – Joseph S.B. Mitchell - 1998
15 Connected Domination and Spanning Trees with Many Leaves – Yair Caro, Douglas B. West, Raphael Yuster - 2000
17 Online Multicast Routing with Bandwidth Guarantees: A New Approach using Multicast Network Flow – Murali S. Kodialam, T. V. Lakshman, Sudipta Sengupta - 2000
134 A polylogarithmic approximation algorithm for the group Steiner tree problem – Naveen Garg, Goran Konjevod, R. Ravi - 2000
219 When trees collide: An approximation algorithm for the generalized Steiner problem on networks – Ajit Agrawal, Philip Klein, R. Ravi - 1994
3 Complexity and approximation results for the connected vertex cover problem – Bruno Escoffier, Laurent Gourvès, Jérôme Monnot, Université Paris-dauphine, Place Maréchal, De Lattre
2 A Near-linear-time Approximation Algorithm for Maximum-leaf Spanning Tree – Hsueh-I Lu, R. Ravi - 1996
2 Leafy spanning trees in hypercubes – W. Duckworth, P.E. Dunne, A. M. Gibbons, M. Zito - 1997
25 Approximating Maximum Leaf Spanning Trees in Almost Linear Time – Hsueh-i Lu, R. Ravi - 1998
Spanning Trees with many Leaves in Regular Bipartite Graphs. – Emanuele G. Fusco, Angelo Monti
1 Budget Constrained Minimum Cost Connected Medians – Goran Konjevod, Sven O. Krumke, Madhav V. Marathe, Konrad-zuse-zentrum F Ur Informationstechnik
16 Approximating some network design problems with vertex costs – Guy Kortsarz, Zeev Nutov - 2009
Abstract – Ashkan Aazami, Michael David Stilp - 2008
4 Service-Constrained Network Design Problems – Madhav V. Marathe, R. Ravi, Ravi Sundaram - 1996