Robust matchings

被引：28
|
作者：
Hassin, R [1 ]
Rubinstein, S [1 ]
机构：
[1] Tel Aviv Univ, Dept Stat & Operat Res, IL-69978 Tel Aviv, Israel
来源：
SIAM JOURNAL ON DISCRETE MATHEMATICS | 2002年 / 15卷 / 04期
关键词：
robust matching; maximum clustering;
D O I：
10.1137/S0895480198332156
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
We consider complete graphs with nonnegative edge weights. A p-matching is a set of p disjoint edges. We prove the existence of a maximal (with respect to inclusion) matching M that contains for any p<|M| p edges whose total weight is at least 1/√2 of the maximum weight of a p-matching. We use this property to approximate the metric maximum clustering problem with given cluster sizes.
引用
收藏
页码：530 / 537
页数：8
相关论文
共 50 条
  • [1] Robust Randomized Matchings
    Matuschke, Jannik
    Skutella, Martin
    Soto, Jose A.
    MATHEMATICS OF OPERATIONS RESEARCH, 2018, 43 (02) : 675 - 692
  • [2] Robust matchings and maximum clustering
    Hassin, R
    Rubinstein, S
    ALGORITHM THEORY - SWAT 2000, 2000, 1851 : 251 - 258
  • [3] Robust Matchings and Matroid Intersections
    Fujita, Ryo
    Kobayashi, Yusuke
    Makino, Kazuhisa
    ALGORITHMS-ESA 2010, PT II, 2010, 6347 : 123 - +
  • [4] ROBUST MATCHINGS AND MATROID INTERSECTIONS
    Fujita, Ryo
    Kobayashi, Yusuke
    Makino, Kazuhisa
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (03) : 1234 - 1256
  • [5] Robust recoverable perfect matchings
    Dourado, Mitre Costa
    Meierling, Dirk
    Penso, Lucia D.
    Rautenbach, Dieter
    Protti, Fabio
    de Almeida, Aline Ribeiro
    NETWORKS, 2015, 66 (03) : 210 - 213
  • [6] TRANSFORMATION FROM ARBITRARY MATCHINGS TO STABLE MATCHINGS
    TAMURA, A
    JOURNAL OF COMBINATORIAL THEORY SERIES A, 1993, 62 (02) : 310 - 323
  • [7] Matchings Extend to Perfect Matchings on Hypercube Networks
    Chen, Y-Chuang
    Li, Kun-Lung
    INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS (IMECS 2010), VOLS I-III, 2010, : 455 - +
  • [8] Maximum induced matchings close to maximum matchings
    Duarte, Marcio A.
    Joos, Felix
    Penso, Lucia D.
    Rautenbach, Dieter
    Souza, Ueverton S.
    THEORETICAL COMPUTER SCIENCE, 2015, 588 : 131 - 137
  • [9] UNDERSTANDING POPULAR MATCHINGS VIA STABLE MATCHINGS
    Cseh, Agnes
    Faenza, Yuri
    Kavitha, Telikepalli
    Powers, Vladlena
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2022, 36 (01) : 188 - 213
  • [10] On Distance-3 Matchings and Induced Matchings
    Brandstaedt, Andreas
    Mosca, Raffaele
    GRAPH THEORY, COMPUTATIONAL INTELLIGENCE AND THOUGHT: ESSAYS DEDICATED TO MARTIN CHARLES GOLUMBIC ON THE OCCASION OF HIS 60TH BIRTHDAY, 2009, 5420 : 116 - +
12345