Approximating weighted matchings in parallel

被引：16
|
作者：
Hougardy, Stefan [1 ]
Vinkemeier, Doratha E. [1 ]
机构：
[1] Humboldt Univ, Inst Informat, D-10099 Berlin, Germany
来源：
INFORMATION PROCESSING LETTERS | 2006年 / 99卷 / 03期
关键词：
approximation algorithms; parallel algorithms; analysis of algorithms; graph algorithms; maximum weight matching;
D O I：
10.1016/j.ipl.2006.03.005
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1- epsilon). This improves the previously best approximation ratio of (1/2 - epsilon) of an algorithm for this problem. (c) 2006 Elsevier B.V. All rights reserved.
引用
收藏
页码：119 / 123
页数：5
相关论文
共 50 条
  • [41] Approximating Bayesian inference by weighted likelihood
    Wang, Xiaogang
    CANADIAN JOURNAL OF STATISTICS-REVUE CANADIENNE DE STATISTIQUE, 2006, 34 (02): : 279 - 298
  • [42] Sublinear Estimation of Weighted Matchings in Dynamic Data Streams
    Bury, Marc
    Schwiegelshohn, Chris
    ALGORITHMS - ESA 2015, 2015, 9294 : 263 - 274
  • [43] Improved linear time approximation algorithms for weighted matchings
    Drake, DE
    Hougardy, S
    APPROXIMATION, RANDOMIZATION, AND COMBINATORIAL OPTIMIZATION, 2003, 2764 : 14 - 23
  • [44] Approximating Nash Social Welfare under Submodular Valuations through (Un) Matchings
    Garg, Jugal
    Kulkarni, Pooja
    Kulkarni, Rucha
    PROCEEDINGS OF THE THIRTY-FIRST ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS (SODA'20), 2020, : 2673 - 2687
  • [45] The characteristic polynomial and the matchings polynomial of a weighted oriented graph
    Gong, Shi-Cai
    Xu, Guang-Hui
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2012, 436 (09) : 3597 - 3607
  • [46] Parameterized Algorithms for Disjoint Matchings in Weighted Graphs with Applications
    Chen, Zhi-Zhong
    Tsukiji, Tatsuie
    Yamada, Hiroki
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2016, E99A (06): : 1050 - 1058
  • [47] Polyhedral approach to weighted connected matchings in general graphs
    Samer, Phillippe
    Moura, Phablo F. S.
    DISCRETE APPLIED MATHEMATICS, 2024, 359 : 143 - 152
  • [48] Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
    Garg, Jugal
    Kulkarni, Pooja
    Kulkarni, Rucha
    ACM TRANSACTIONS ON ALGORITHMS, 2023, 19 (04)
  • [49] Approximating Nash Social Welfare under Submodular Valuations through (Un)Matchings
    Garg, Jugal
    Kulkarni, Pooja
    Kulkarni, Rucha
    PROCEEDINGS OF THE 2020 ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2020, : 2673 - 2687
  • [50] Matchings in node-weighted convex bipartite graphs
    Katriel, Irit
    INFORMS JOURNAL ON COMPUTING, 2008, 20 (02) : 205 - 211
12345