activity
20132024
most citedA Note on Connected Dominating Set in Graphs Without Long Paths And Cycles

3 citations · 3 across the 4 of their papers we have counts for

collaborators
Showing 2017 · cs.DSShow all

1 paper · 2 filters

cs.DS2017

Fast Algorithms for Delta-Separated Sparsity Projection

Henning Bruhn, Oliver Schaudt

We describe a fast approximation algorithm for the -separated sparsity projection problem. The -separated sparsity model was introduced by Hegde, Duarte and Cevher (2009) to…