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 条
  • [31] Matchings and pfaffians
    Nambiar, KK
    MATHEMATICAL AND COMPUTER MODELLING, 1997, 25 (02) : 1 - 2
  • [32] Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching
    Blumenthal, David B.
    Bougleux, Sébastien
    Dignös, Anton
    Gamper, Johann
    Information Sciences, 2022, 596 : 202 - 221
  • [33] Ordered Unavoidable Sub-Structures in Matchings and Random Matchings
    Dudek, Andrzej
    Grytczuk, Jaros law
    Rucinski, Andrzej
    ELECTRONIC JOURNAL OF COMBINATORICS, 2024, 31 (02):
  • [34] Disconnected matchings
    Gomes, Guilherme C. M.
    Masquio, Bruno P.
    Pinto, Paulo E. D.
    dos Santos, Vinicius F.
    Szwarcfiter, Jayme L.
    THEORETICAL COMPUTER SCIENCE, 2023, 956
  • [35] Simultaneous matchings
    Elbassioni, K
    Katriel, I
    Kutz, M
    Mahajan, M
    ALGORITHMS AND COMPUTATION, 2005, 3827 : 106 - 115
  • [36] Enumerating dissimilar minimum cost perfect and error-correcting bipartite matchings for robust data matching
    Blumenthal, David B.
    Bougleux, Sebastien
    Dignos, Anton
    Gamper, Johann
    INFORMATION SCIENCES, 2022, 596 : 202 - 221
  • [37] COLORFUL MATCHINGS
    Arman, Andrii
    Rodl, Vojtech
    Sales, Marcelo Tadeu
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (02) : 925 - 950
  • [38] On Compatible Matchings
    Aichholzer O.
    Arroyo A.
    Masárová Z.
    Parada I.
    Perz D.
    Pilz A.
    Tkadlec J.
    Vogtenhuber B.
    Journal of Graph Algorithms and Applications, 2022, 26 (02) : 225 - 240
  • [39] ON INDUCED MATCHINGS
    STEGER, A
    YU, ML
    DISCRETE MATHEMATICS, 1993, 120 (1-3) : 291 - 295
  • [40] Disconnected Matchings
    Gomes, Guilherme C. M.
    Masquio, Bruno P.
    Pinto, Paulo E. D.
    dos Santos, Vinicius F.
    Szwarcfiter, Jayme L.
    COMPUTING AND COMBINATORICS (COCOON 2021), 2021, 13025 : 579 - 590
12345