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 条
  • [21] Popular Matchings
    Abraham, David J.
    Irving, Robert W.
    Kavitha, Telikepalli
    Mehlhorn, Kurt
    PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 424 - 432
  • [22] On matchings in graphs
    Jones, DM
    Roehm, DJ
    Schultz, M
    ARS COMBINATORIA, 1998, 50 : 65 - 79
  • [23] Flexible matchings
    Bartha, Miklos
    Kresz, Miklos
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2006, 4271 : 313 - +
  • [24] Orthogonal matchings
    Anstee, RP
    Caccetta, L
    DISCRETE MATHEMATICS, 1998, 179 (1-3) : 37 - 47
  • [25] Orthogonal matchings
    Discrete Math, 1-3 (37-47):
  • [26] SHAPES OF MATCHINGS
    STROK, M
    BULLETIN DE L ACADEMIE POLONAISE DES SCIENCES-SERIE DES SCIENCES MATHEMATIQUES ASTRONOMIQUES ET PHYSIQUES, 1976, 24 (04): : 265 - 270
  • [27] ON OPTIMAL MATCHINGS
    AJTAI, M
    KOMLOS, J
    TUSNADY, G
    COMBINATORICA, 1984, 4 (04) : 259 - 264
  • [28] Orthogonal matchings
    Stong, R
    DISCRETE MATHEMATICS, 2002, 256 (1-2) : 513 - 518
  • [29] Connected matchings
    Cameron, K
    COMBINATORIAL OPTIMIZATION - EUREKA, YOU SHRINK: PAPERS DEDICATED TO JACK EDMONDS, 2003, 2570 : 34 - 38
  • [30] PERFECT MATCHINGS
    BALINSKI, ML
    SIAM REVIEW, 1970, 12 (04) : 570 - &
12345