Robust subgraphs for trees and paths
ACM Transactions on Algorithms (TALG)
Information Processing Letters
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
On the maximum quadratic assignment problem
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
On the Maximum Quadratic Assignment Problem
Mathematics of Operations Research
Information Processing Letters
Return of the boss problem: competing online against a non-adaptive adversary
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
Robust matchings and matroid intersections
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part II
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Computing knapsack solutions with cardinality robustness
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Approximation algorithms for maximum latency and partial cycle cover
Discrete Optimization
Approximation algorithms for the metric maximum clustering problem with given cluster sizes
Operations Research Letters
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
| Hi-index | 0.00 |
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\le|M|$ $p$ edges whose total weight is at least ${1\over \sqrt 2}$ of the maximum weight of a p-matching. We use this property to approximate the metric maximum clustering problem with given cluster sizes.