15 citations · 16 across the 2 of their papers we have counts for
2 papers
cs.LG2017★ 15 cited
Decomposable Submodular Function Minimization: Discrete and Continuous
Alina Ene, Huy L. Nguyen, László A. Végh
This paper investigates connections between discrete and continuous approaches for decomposable submodular function minimization. We provide improved running time estimates for the…
cs.DM2012★ 1 cited
Approximating Minimum-Cost k-Node Connected Subgraphs via Independence-Free Graphs
Joseph Cheriyan, Laszlo A. Vegh
We present a 6-approximation algorithm for the minimum-cost -node connected spanning subgraph problem, assuming that the number of nodes is at least . We apply a com…