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 条
  • [41] DYNAMIC MATCHINGS AND QUASIDYNAMIC FRACTIONAL MATCHINGS. I.
    Orlin, James B.
    Networks, 1981, 13 (04) : 551 - 562
  • [42] Classified Rank-Maximal Matchings and Popular Matchings - Algorithms and Hardness
    Nasre, Meghana
    Nimbhorkar, Prajakta
    Pulath, Nada
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE (WG 2019), 2019, 11789 : 244 - 257
  • [43] Characterization of Dynamics of Stable Matchings: Attractors Mapped from Stable Matchings
    Ishida, Yoshiteru
    Sato, Takumi
    17TH INTERNATIONAL CONFERENCE IN KNOWLEDGE BASED AND INTELLIGENT INFORMATION AND ENGINEERING SYSTEMS - KES2013, 2013, 22 : 672 - 679
  • [44] Perfect Matchings with Crossings
    Aichholzer, Oswin
    Fabila-Monroy, Ruy
    Kindermann, Philipp
    Parada, Irene
    Paul, Rosna
    Perz, Daniel
    Schnider, Patrick
    Vogtenhuber, Birgit
    ALGORITHMICA, 2024, 86 (03) : 697 - 716
  • [45] Bichromatic compatible matchings
    Aloupis, Greg
    Barba, Luis
    Langerman, Stefan
    Souvaine, Diane L.
    COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2015, 48 (08): : 622 - 633
  • [46] Almost Exact Matchings
    Yuster, Raphael
    ALGORITHMICA, 2012, 63 (1-2) : 39 - 50
  • [47] Mixed matchings in graphs
    Frankl, Peter
    DISCRETE MATHEMATICS, 2020, 343 (02)
  • [48] Bounded unpopularity matchings
    Huang, Chien-Chung
    Kavitha, Telikepalli
    Michail, Dimitrios
    Nasre, Meghana
    ALGORITHM THEORY - SWAT 2008, 2008, 5124 : 127 - +
  • [49] Perfect Matchings with Crossings
    Oswin Aichholzer
    Ruy Fabila-Monroy
    Philipp Kindermann
    Irene Parada
    Rosna Paul
    Daniel Perz
    Patrick Schnider
    Birgit Vogtenhuber
    Algorithmica, 2024, 86 : 697 - 716
  • [50] Popular mixed matchings
    Kavitha, Telikepalli
    Mestre, Julian
    Nasre, Meghana
    THEORETICAL COMPUTER SCIENCE, 2011, 412 (24) : 2679 - 2690
12345