中国科学院机构知识库网格
Chinese Academy of Sciences Institutional Repositories Grid
首页 机构 成果 学者
  
  1. CAS IR Grid
  2. 计算技术研究所
  3. 中国科学院计算技术研究所
  4. 中国科学院计算技术研究所期刊论文
  5. 英文
Near optimal algorithms for online weighted bipartite matching in adversary model

文献类型：期刊论文

作者Sun, Xiaoming1,2; Zhang, Jia1,2; Zhang, Jialin1,2
刊名JOURNAL OF COMBINATORIAL OPTIMIZATION
出版日期2017-10-01
卷号34期号:3页码:689-705
关键词Online matching Weighted bipartite graph Adversary model Near optimal algorithm
ISSN号1382-6905
DOI10.1007/s10878-016-0100-2
英文摘要Bipartite matching is an important problem in graph theory. With the prosperity of electronic commerce, such as online auction and AdWords allocation, bipartite matching problem has been extensively studied under online circumstances. In this work, we study the online weighted bipartite matching problem in adversary model, that is, there is a weighted bipartite graph and the left side L is known as input, while the vertices in R come one by one in an order arranged by the adversary. When each vertex in R comes, its adjacent edges and relative weights are revealed. The algorithm should irreversibly decide whether to match this vertex to an unmatched neighbor in L with the objective to maximize the total weight of the obtained matching. When the weights are unbounded, the best algorithm can only achieve a competitive ratio , where n is the number of vertices coming online. Thus, we mainly deal with two variants: the bounded weight problem in which all weights are in the range , and the normalized summation problem in which each vertex in one side has the same total weights. We design algorithms for both variants with competitive ratio and respectively. Furthermore, we show these two competitive ratios are tight by providing the corresponding hardness results.
资助项目National Natural Science Foundation of China[61222202] ; National Natural Science Foundation of China[61433014] ; National Natural Science Foundation of China[61502449] ; National Natural Science Foundation of China[61602440] ; 973 Program of China[2016YFB1000201] ; China National Program for support of Top-notch Young Professionals
WOS研究方向Computer Science ; Mathematics
语种英语
WOS记录号WOS:000411586300003
出版者SPRINGER
源URL[http://119.78.100.204/handle/2XEOYT63/6774]  
专题中国科学院计算技术研究所期刊论文_英文
通讯作者Zhang, Jia
作者单位1.Chinese Acad Sci, Inst Comp Technol, CAS Key Lab Network Data Sci & Technol, Beijing 100190, Peoples R China
2.Univ Chinese Acad Sci, Beijing 100049, Peoples R China
推荐引用方式
GB/T 7714		 Sun, Xiaoming,Zhang, Jia,Zhang, Jialin. Near optimal algorithms for online weighted bipartite matching in adversary model[J]. JOURNAL OF COMBINATORIAL OPTIMIZATION,2017,34(3):689-705.
APA Sun, Xiaoming,Zhang, Jia,&Zhang, Jialin.(2017).Near optimal algorithms for online weighted bipartite matching in adversary model.JOURNAL OF COMBINATORIAL OPTIMIZATION,34(3),689-705.
MLA Sun, Xiaoming,et al."Near optimal algorithms for online weighted bipartite matching in adversary model".JOURNAL OF COMBINATORIAL OPTIMIZATION 34.3(2017):689-705.

入库方式： OAI收割

来源：计算技术研究所

浏览0
下载0
收藏0
其他版本

除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。