A primal-dual schema based approximation algorithm for the element connectivity problem

Authors:
Kamal Jain;Ion Măndoiu;Vijay V. Vazirani;David P. Williamson
Affiliations:
College of Computing, Georgia Institute of Technology;College of Computing, Georgia Institute of Technology;College of Computing, Georgia Institute of Technology;IBM T.J. Wastson Research Center
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Citing 7
Cited 10

Augmenting graphs to meet edge-connectivity requirements

SIAM Journal on Discrete Mathematics
Computational results with a cutting plane algorithm for designing communication networks with low-connectivity constraints

Operations Research
Improved approximation algorithms for uniform connectivity problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The primal-dual method for approximation algorithms and its application to network design problems

Approximation algorithms for NP-hard problems
A commercial application of survivable network design: ITP/INPLANS CCS network topology analyzer

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Improved approximation algorithms for network design problems

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science

Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation

Journal of the ACM (JACM)
Approximation algorithms for minimum-cost k-vertex connected subgraphs

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
A primal-dual schema based approximation algorithm for the element connectivity problem

Journal of Algorithms
A primal-dual approximation algorithm for the survivable network design problem in hypergraphs

Discrete Applied Mathematics
A Primal-Dual Approximation Algorithm for the Survivable Network Design Problem in Hypergraph

STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Primal-Dual Approximation Algorithms for Metric Facility Location and k-Median Problems

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Packing element-disjoint steiner trees

ACM Transactions on Algorithms (TALG)
Approximate min--max theorems for Steiner rooted-orientations of graphs and hypergraphs

Journal of Combinatorial Theory Series B
A Graph Reduction Step Preserving Element-Connectivity and Applications

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Packing element-disjoint steiner trees

APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques

Quantified Score

Hi-index	0.00

A primal-dual schema based approximation algorithm for the element connectivity problem

Quantified Score

Visualization

Abstract