4 citations · 5 across the 3 of their papers we have counts for
3 papers
cs.DS2014★ 1 cited
Space Saving by Dynamic Algebraization
Martin Furer, Huiwen Yu
Dynamic programming is widely used for exact computations based on tree decompositions of graphs. However, the space complexity is usually exponential in the treewidth. We study th…
cs.DS2013★ 4 cited
Approximate the k-Set Packing Problem by Local Improvements
Martin Furer, Huiwen Yu
We study algorithms based on local improvements for the -Set Packing problem. The well-known local improvement algorithm by Hurkens and Schrijver has been improved by Sviridenko…
cs.DS2011
Packing-Based Approximation Algorithm for the k-Set Cover Problem
Martin Furer, Huiwen Yu
We present a packing-based approximation algorithm for the -Set Cover problem. We introduce a new local search-based -set packing heuristic, and call it Restricted -Set Pa…