143 citations · 381 across the 13 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
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.DS2013
On Some Recent MAX SAT Approximation Algorithms
Matthias Poloczek, David P. Williamson, Anke van Zuylen
Recently a number of randomized 3/4-approximation algorithms for MAX SAT have been proposed that all work in the same way: given a fixed ordering of the variables, the algorithm ma…