2 citations · 4 across the 3 of their papers we have counts for
3 papers
cs.DS2015★ 1 cited
Greedy Matching: Guarantees and Limitations
Bert Besser, Matthias Poloczek
Since Tinhofer proposed the MinGreedy algorithm for maximum cardinality matching in 1984, several experimental studies found the randomized algorithm to perform excellently for var…
cs.DS2015★ 1 cited
On the Approximation Performance of Degree Heuristics for Matching
Bert Besser, Bastian Werth
In the design of greedy algorithms for the maximum cardinality matching problem the utilization of degree information when selecting the next edge is a well established and success…
cs.DS2014★ 2 cited
Approximation Bounds For Minimum Degree Matching
Bert Besser
We consider the MINGREEDY strategy for Maximum Cardinality Matching. MINGREEDY repeatedly selects an edge incident with a node of minimum degree. For graphs of degree at most w…