S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings, Proc. 24th ACM Symposium on Theory of Computing, pp. 759--770, (1992). Also, to appear in Journal of the ACM.  Home/Search   Document Not in Database   Summary   Related Articles

....graph, approximation algorithm, strong connectivity, local improvement. 1. Introduction. Connectivity is fundamental to the study of graphs and graph algorithms. Recently, many approximation algorithms for finding minimum subgraphs that meet given connectivity requirements have been developed [1, 9, 11, 15, 16, 24]. These results provide practical approximation algorithms for NP hard network design problems via an increased understanding of connectivity properties. Until now, the techniques developed have been applicable only to undirected graphs. We consider a basic network design problem in directed ....

....Soroker and Tarjan [10] give a parallel algorithm. A related problem in undirected graphs is to find a smallest subset of the edges forming a biconnected (respectively bridge connected (i.e. 2 edge connected) spanning subgraph of a given graph. These problems are NP hard. Khuller and Vishkin [15] give a DFS based algorithm that achieves a factor of 5 3 for biconnectivity and 3 2 for bridge connectivity. Garg, Santosh and Singla [9] subsequently improve the approximation factors, using a similar approach, to 3 2 and 5 4 , respectively. None of these methods appear to extend directly to ....

[Article contains additional citation context not shown here]

S. Khuller and U. Vishkin, Biconnectivity approximations and graph carvings, Proc. 24th ACM Symposium on Theory of Computing, pp. 759--770, (1992). Also, to appear in Journal of the ACM.

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