31 citations · 155 across the 25 of their papers we have counts for
Showing 2016 · cs.DSShow all
2 papers · 2 filters
cs.DS2016★ 17 cited
On the Power of Simple Reductions for the Maximum Independent Set Problem
Darren Strash
Reductions---rules that reduce input size while maintaining the ability to compute an optimal solution---are critical for developing efficient maximum independent set algorithms in…
cs.DS2016★ 2 cited
Accelerating Local Search for the Maximum Independent Set Problem
Jakob Dahlum, Sebastian Lamm, Peter Sanders +3
Computing high-quality independent sets quickly is an important problem in combinatorial optimization. Several recent algorithms have shown that kernelization techniques can be use…