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 条
  • [21] On the Number of Group-Weighted Matchings
    Jeff Kahn
    Roy Meshulam
    Journal of Algebraic Combinatorics, 1998, 7 : 285 - 290
  • [22] Approximating biconnectivity in parallel
    Chong, KW
    Lam, TW
    ALGORITHMICA, 1998, 21 (04) : 395 - 410
  • [23] Planar Matchings for Weighted Straight Skeletons
    Biedl, Therese
    Huber, Stefan
    Palfrader, Peter
    ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 117 - 127
  • [24] Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies
    Baste, Julien
    Fuerst, Maximilian
    Rautenbach, Dieter
    COMPUTING AND COMBINATORICS (COCOON 2020), 2020, 12273 : 542 - 553
  • [25] Approximating total weighted completion time on identical parallel machines with precedence constraints and release dates
    Jaeger, Sven
    OPERATIONS RESEARCH LETTERS, 2018, 46 (05) : 505 - 509
  • [26] Approximating scheduling unrelated parallel machines in parallel
    Serna, M
    Xhafa, F
    COMPUTATIONAL OPTIMIZATION AND APPLICATIONS, 2002, 21 (03) : 325 - 338
  • [27] Approximating Scheduling Unrelated Parallel Machines in Parallel
    Maria Serna
    Fatos Xhafa
    Computational Optimization and Applications, 2002, 21 : 325 - 338
  • [28] Constrained weighted matchings and edge coverings in graphs
    Plesník, J
    DISCRETE APPLIED MATHEMATICS, 1999, 92 (2-3) : 229 - 241
  • [29] Strong and weighted matchings in inhomogenous random graphs
    Ganesan, Ghurumuruhan
    ELECTRONIC COMMUNICATIONS IN PROBABILITY, 2021, 26 : 1 - 12
  • [30] On the total weight of weighted matchings of segment graphs
    Stoll, Thomas
    Zeng, Jiang
    ELECTRONIC JOURNAL OF COMBINATORICS, 2009, 16 (01):
12345