Edge covers of setpairs and the iterative rounding method

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2081, Issue , 2001, Pages 30-44

  Cheriyan, Joseph ^a   Vempala, Santosh ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL OPTIMIZATION; ITERATIVE METHODS; LINEAR PROGRAMMING; SET THEORY;

EXTREME POINTS; INTEGER SOLUTIONS; ITERATIVE ROUNDING; LINEAR PROGRAMMING RELAXATION; MINIMUM COST; NONNEGATIVE INTEGERS; OPTIMAL VALUES; PARTIALLY ORDERED SET;

INTEGER PROGRAMMING;

EID: 23044525324     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45535-3_3     Document Type: Conference Paper

References (7)

1. A. Frank and T. Jordan, "Minimal edge-coverings of pairs of sets," J. Combinatorial Theory, Series B, 65:73-110, 1995.
2. K. Jain, "A factor 2 approximation algorithm for the generalized Steiner network problem," Proc. IEEE Foundations of Computer Science, 1998.
3. M. Goemans, A. Goldberg, S. Plotkin, D. Shmoys, E. Tardos and D. Williamson, "Improved approximation algorithms for network design problems," in Proc. ACM SIAM Symposium on Discrete Algorithms, 1994, 223-232.
4. M. Goemans and D. Williamson, "A general approximation technique for constrained forest problems," SIAM Journal on Computing, 24:296-317, 1995.
5. V. Melkonian and E. Tardos, "Approximation algorithms for a directed network design problem," In the Proceedings of the 7th International Integer Programming and Combinatorial Optimization Conference (IPCO'99), Graz, Austria, 1999.
6. A. Schrijver, "Matroids and linking systems," J. Combinatorial Theory, Series B, 26:349-369, 1979.
7. D. Williamson, M. Goemans, M. Mihail, and V. Vazirani, "A primal-dual approximation algorithm for generalized Steiner network problems," Combinatorica, 15:435-454, 1995.