Khaled Elbassioni, Irit Katriel, Martin Kutz, Meena Mahajan  Home/Search
Context
Related
| mpiinf.mpg.de/~mk...KutMah_SimMatch.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mpiinf.mpg.de/~mk...publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Given a bipartite graph G = (X D, E D), an X- perfect matching is a matching in G that saturates every node in X. In this paper we study the following generalisation of the X-perfect matching problem, which has applications in constraint programming: Given a bipartite graph as above and a collection of k subsets of X, find a subset M E of the edges such that for each C , the edge set M D) is a C-perfect matching in G (or report that no such set exists). We show that... (Update)
Active bibliography (related documents): More All
0.5: Complete Bound Consistency for the Global Cardinality Constraint - Katriel, Thiel (Correct)
0.4: The alldifferent Constraint: A Survey - van Hoeve (2001) (Correct)
0.4: Multiconsistency and Robustness with Global Constraints - Elbassioni, Katriel (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ elbassioni-simultaneous,
author = "Khaled Elbassioni and Irit Katriel and Martin Kutz and Meena Mahajan",
title = "Simultaneous Matchings",
url = "citeseer.ist.psu.edu/739975.html" }
Citations (may not include all citations):686 A Guide to the Theory of NP-Completeness (context) - Garey, Johnson et al. - 1979
318 Approximation Algorithms for NP-Hard Problems (context) - Hochbaum - 1996
119 The Hungarian Method for the assignment problem (context) - Kuhn - 1955
45 trees and flowers (context) - Edmonds - 1965
18 Faster Algorithms for Bound-Consistency of the Sortedness an.. - Mehlhorn, Thiel - 2000
14 Annals of Discrete Mathematics (context) - Lovasz, Plummer et al. - 1986
13 A fast algorithm for the bound consistency of alldi# constra.. (context) - Puget - 1998
13 Fast parallel algorithms for graph matching problems (context) - Karpinski, Rytter - 1998
9 erent Constraint: A Survey (context) - van Hoeve - 2001
8 Approximating independent sets in degree 3 graphs (context) - Berman, Fujito - 1995
7 A bounds-based reduction scheme for constraints of di#erence (context) - Leconte - 1996
6 A fast and simple algorithm for bounds consistency of the al.. (context) - Lopez-Ortiz, Quimper et al. - 2003
1 the system of two all di#erent predicates (context) - Appa, Magos et al. - 2005
1 The software PORTA [13] was used to find this vertex (context) - Vazirani, Springer - 2001
1 Inapproximability results for bounded variants of optimizati.. (context) - Chlebk, Chlebkova - 2003
http://www.zib.de/optimization/software/porta/
Documents on the same site (http://www.mpi-inf.mpg.de/~mkutz/publications.html): More
Conway's Angel in Three Dimensions - Kutz (2005) (Correct)
Weak Positional Games on Hypergraphs of Rank Three - Kutz (Correct)
Faster Algorithms for Computing Longest Common.. - Brodal, Kaligosi.. (2005) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC