A 12-integral relaxation for the A-matching problem

Authors:
Robert Carr;Ojas Parekh
Affiliations:
Sandia National Laboratories, Albuquerque, NM, USA;Emory University, Math/CS Department, 400 Dowman Dr., Suite W401, Atlanta GA, USA
Venue:
Operations Research Letters
Year:
2006

Citing 2
Cited 1

General factors of graphs

Journal of Combinatorial Theory Series B
General antifactors of graphs

Journal of Combinatorial Theory Series B

Approximability of bounded occurrence max ones

MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The A-matching problem generalizes matching problems by stipulating that the degree of each vertex lies in a set A"v of admissible values. If these sets have no large ''gaps'', the decision problem is in P, while the complexity of the optimization version is open. We present a polynomial time solvable 12-integral linear relaxation for this case.