Skip to main content
Conference Proceedings

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) (2001) 2081 30-44
DOI: 10.1007/3-540-45535-3_3
9Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Given a digraph G =(V, E), we study a linear programming relaxation of the problem of finding a minimum-cost edge cover of pairs of sets of nodes (called setpairs), where each setpair has a nonnegative integer-valued demand. Our results are as follows: (1) An extreme point of the LP is characterized by a noncrossing family of tight setpairs, L (where |L|

Cite

CITATION STYLE

APA

Cheriyan, J., & Vempala, S. (2001). Edge covers of setpairs and the iterative rounding method. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2081, pp. 30–44). Springer Verlag. https://doi.org/10.1007/3-540-45535-3_3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free