Reducing rank-maximal to maximum weight matching
نویسندگان
چکیده
منابع مشابه
Reducing rank-maximal to maximum weight matching
Given a bipartite graph G(V,E), V = A ∪̇B where |V | = n, |E| = m and a partition of the edge set into r ≤ m disjoint subsets E = E1 ∪̇E2 ∪̇ . . . ∪̇Er, which are called ranks, the rank-maximal matching problem is to find a matching M of G such that |M ∩ E1| is maximized and given that |M ∩ E1| is maximized, |M ∩ E2| is also maximized, and so on. Such a problem arises as an optimization criteria ov...
متن کاملDynamic Matching: Reducing Integral Algorithms to Approximately-Maximal Fractional Algorithms
We present a simple randomized reduction from fully-dynamic integral matching algorithms to fully-dynamic “approximately-maximal” fractional matching algorithms. Applying this reduction to the recent fractional matching algorithm of Bhattacharya, Henzinger, and Nanongkai (SODA 2017), we obtain a novel result for the integral problem. Specifically, our main result is a randomized fully-dynamic (...
متن کاملA simple reduction from maximum weight matching to maximum cardinality matching
Let mcm(m,n) and mwm(m,n,N) be the complexities of computing a maximum cardinality matching and a maximum weight matching, and let mcmbi,mwmbi be their counterparts for bipartite graphs, where m,n, and N are the edge count, vertex count, and maximum integer edge weight. Kao, Lam, Sung, and Ting [1] gave a general reduction showing mwmbi(m,n,N) = O(N ·mcmbi(m,n)) and Huang and Kavitha [2] recent...
متن کاملAttributed Tree Matching and Maximum Weight Cliques
A classical way of matching relational structures consists of finding a maximum clique in a derived “association graph.” However, it is not clear how to apply this approach to problems where the graphs are hierarchically organized, i.e. are trees, since maximum cliques are not constrained to preserve the partial order. We have recently provided a solution to this problem by constructing the ass...
متن کاملThe maximum weight hierarchy matching problem
We study the problem of fusing several reports about a group of objects into a single summary report, which best represents the received reports. A report is a list of labels associated with a group of objects, as reported by some identification device. Reports do not associate which object in the group has been given a specific label, the labels used in each report may be given in various leve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.08.004