Simultaneous matchings

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

Volumn 3827 LNCS, Issue , 2005, Pages 106-115

  Elbassioni, Khaled ^a   Katriel, Irit ^b   Kutz, Martin ^a   Mahajan, Meena ^c  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^b AARHUS UNIVERSITY   (Denmark)

^c INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; COMPUTER APPLICATIONS; DECISION THEORY; GRAPH THEORY; PROBLEM SOLVING; SET THEORY;

BIPARTITE GRAPHS; CONSTRAINT PROGRAMMING; SIMULTANEOUS MATCHINGS; X-PERFECT MATCHING;

THEOREM PROVING;

EID: 33744961219     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_12     Document Type: Conference Paper

References (16)

1. G. Appa, D. Magos, and I. Mourtos. On the system of two all-different predicates. Information Processing Letters, 94/3:99-105, 2005.
2. P. Herman and T. Fujito. Approximating independent sets in degree 3 graphs. In WADS 1995, volume 955 of LNCS, pages 449-460, 1995.
3. M. Chlebík and J. Chlebíková. Inapproximability results for bounded variants of optimization problems. In FCT 8003, volume 2751 of LNCS, pages 27-38, 2003.
4. J. Edmonds. Path, trees and flowers. Canadian Journal of Mathematics, pages 233-240, 1965.
5. M. Garey and D. S. Johnson. Computers and Intractability, A Guide to the Theory of NP-Completeness. Freeman, 1979.
6. D. S. Hochbaum, editor. Approximation Algorithms for NP-Hard Problems. Brooks/Cole Pub. Co., 1996.
7. M. Karpinski and W. Rytter. Fast parallel algorithms for graph matching problems. 1998. Oxford Lecture Series in Mathematics and its Applications 9.
8. H.W. Kuhn. The Hungarian Method for the assignment problem. Naval Research Logistic Quarterly, 2:83-97, 1955.
9. M. Leconte. A bounds-based reduction scheme for constraints of difference. In Proceedings of the Constraint-96 Workshop, pages 19-28, 1996.
10. A. Lopez-Ortiz, C.-G. Quimper, J. Tromp, and P. van Beek. A fast and simple algorithm for bounds consistency of the alldifferent constraint. In IJCAI, 2003.
11. L. Lovasz and M. Plummer. Matching Theory. North-Holland, 1986. Annals of Discrete Mathematics 29.
12. K. Mehlhorn and S. Thiel. Faster Algorithms for Bound-Consistency of the Sort-edness and the AllDifferent Constraint. In CP, 2000.
13. PORTA, http://www.zib.de/optimization/software/porta/.
14. J.-F. Puget. A fast algorithm for the bound consistency of alldiff constraints. In AAAI, 1998.
15. W.J. van Hoeve. The AllDifferent Constraint: A Survey. In Proceedings of the Sixth Annual Workshop of the ERCIM Working Group on Constraints, 2001.
16. V. Vazirani. Approximation Algorithms. Springer, 2001.