Robust matchings

Refael Hassin; Shlomi Rubinstein

doi:10.1137/S0895480198332156

Robust matchings

Refael Hassin^*
, Shlomi Rubinstein

^*Corresponding author for this work

School of Mathematical Sciences

Tel Aviv University

Research output: Contribution to journal › Article › peer-review

37 Scopus citations

Abstract

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.

Original language	English
Pages (from-to)	530-537
Number of pages	8
Journal	SIAM Journal on Discrete Mathematics
Volume	15
Issue number	4
DOIs	https://doi.org/10.1137/S0895480198332156
State	Published - Jul 2002

Keywords

Maximum clustering
Robust matching

Access to Document

10.1137/S0895480198332156

Cite this

@article{0277809307834341b25c21d3cd4555cf,

title = "Robust matchings",

abstract = "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.",

keywords = "Maximum clustering, Robust matching",

author = "Refael Hassin and Shlomi Rubinstein",

year = "2002",

month = jul,

doi = "10.1137/S0895480198332156",

language = "אנגלית",

volume = "15",

pages = "530--537",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics (SIAM)",

number = "4",

}

TY - JOUR

T1 - Robust matchings

AU - Hassin, Refael

AU - Rubinstein, Shlomi

PY - 2002/7

Y1 - 2002/7

N2 - 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.

AB - 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.

KW - Maximum clustering

KW - Robust matching

UR - https://www.scopus.com/pages/publications/0036662370

U2 - 10.1137/S0895480198332156

DO - 10.1137/S0895480198332156

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0036662370

SN - 0895-4801

VL - 15

SP - 530

EP - 537

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 4

ER -

Robust matchings

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this