License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ESA.2016.3
URN: urn:nbn:de:0030-drops-63443
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2016/6344/
Abolhassani, Melika ;
Chan, T.-H. Hubert ;
Chen, Fei ;
Esfandiari, Hossein ;
Hajiaghayi, MohammadTaghi ;
Hamid, Mahini ;
Wu, Xiaowei
Beating Ratio 0.5 for Weighted Oblivious Matching Problems
Abstract
We prove the first non-trivial performance ratios strictly above 0.5 for weighted versions of the oblivious matching problem.
Even for the unweighted version, since Aronson, Dyer, Frieze, and Suen first proved a non-trivial ratio above 0.5 in the mid-1990s, during the next twenty years several attempts have been made to improve this ratio, until Chan, Chen, Wu and Zhao successfully achieved a significant ratio of 0.523 very recently (SODA 2014). To the best of our knowledge, our work is the first in the literature that considers the node-weighted and edge-weighted versions of the problem in arbitrary graphs (as opposed to bipartite graphs).
(1) For arbitrary node weights, we prove that a weighted version of the Ranking algorithm has ratio strictly above 0.5. We have discovered a new structural property of the ranking algorithm: if a node has two unmatched neighbors at the end of algorithm, then it will still be matched even when its rank is demoted to the bottom. This property allows us to form LP constraints for both the node-weighted and the unweighted oblivious matching problems. As a result, we prove that the ratio for the node-weighted case is at least 0.501512. Interestingly via the structural property, we can also improve slightly the ratio for the unweighted case to 0.526823 (from the previous best 0.523166 in SODA 2014).
(2) For a bounded number of distinct edge weights, we show that ratio strictly above 0.5 can be achieved by partitioning edges carefully according to the weights, and running the (unweighted) Ranking algorithm on each part. Our analysis is based on a new primal-dual framework known as \emph{matching coverage}, in which dual feasibility is bypassed. Instead, only dual constraints corresponding to edges in an optimal matching are satisfied.
Using this framework we also design and analyze an algorithm for the edge-weighted online bipartite matching problem with free disposal. We prove that for the case of bounded online degrees, the ratio is strictly above 0.5.
BibTeX - Entry
@InProceedings{abolhassani_et_al:LIPIcs:2016:6344,
author = {Melika Abolhassani and T.-H. Hubert Chan and Fei Chen and Hossein Esfandiari and MohammadTaghi Hajiaghayi and Mahini Hamid and Xiaowei Wu},
title = {{Beating Ratio 0.5 for Weighted Oblivious Matching Problems}},
booktitle = {24th Annual European Symposium on Algorithms (ESA 2016)},
pages = {3:1--3:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-015-6},
ISSN = {1868-8969},
year = {2016},
volume = {57},
editor = {Piotr Sankowski and Christos Zaroliagis},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2016/6344},
URN = {urn:nbn:de:0030-drops-63443},
doi = {10.4230/LIPIcs.ESA.2016.3},
annote = {Keywords: Weighted matching, oblivious algorithms, Ranking, linear programming}
}
|
Keywords: |
|
Weighted matching, oblivious algorithms, Ranking, linear programming |
|
Collection: |
|
24th Annual European Symposium on Algorithms (ESA 2016) |
|
Issue Date: |
|
2016 |
|
Date of publication: |
|
18.08.2016 |
