Edge dominating and hypomatchable sets

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 06-08-January-2002, Issue , 2002, Pages 287-291

  Parekh, Ojas ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMABILITY; EDGE COVER; EDGE DOMINATING SET; MINIMUM COST; NP COMPLETE; VERTEX COVER; VERTEX COVER PROBLEMS;

ALGORITHMS;

EID: 33750722243     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (9)

1. A. Blum. Personal communication.
2. R. Carr, T. Pujito, G. Konjevod, and O. Parekh. A 2 1/10-approximation algorithm for a generalization of the weighted edge-dominating set problem. Journal of Combinatorial Optimization, 5:317-326, 2001.
3. W. Cook, W. Cunningham, W. Pulleyblank, and A. Schrijver. Combinatorial Optimization. Wiley-Interscience, New York, 1998.
4. J. Edmonds and E. Johnson. Matching: A well-solved class of integer linear programs. In Combinatorial Structures and their Applications, New York, 1970. Gordon and Breach.
5. M. W. Padberg and M. R. Rao. Odd minimum cut-sets and b-matchings. Mathematics of Operations Research, 7:67-80, 1982.
6. W. Pulleyblank. Faces of Matching Polyhedra. PhD thesis, University of Waterloo, 1973.
7. A. Schrijver. Short proofs on the matching polytope. Journal of Combinatorial Theory (Series B), 34:104-108, 1983.
8. A. Schrijver. Theory of Linear and Integer Programming. Wiley-Interscience, Chichester, 1986.
9. M. Yannakakis and F. Gavril. Edge dominating sets in graphs. SIAM Journal of Applied Mathematics, 38(3):364-372, 1980.