László A. Végh

activity

20112026

most citedDecomposable Submodular Function Minimization: Discrete and Continuous

15 citations · 42 across the 16 of their papers we have counts for

collaborators

Showing cs.DMShow all

2 papers · 1 filter

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 $k$ -node connected spanning subgraph problem, assuming that the number of nodes is at least $k^{3} (k - 1) + k$ . We apply a com…

cs.DM2012★ 9 cited

Oriented Euler Complexes and Signed Perfect Matchings

László A. Végh, Bernhard von Stengel

This paper presents "oriented pivoting systems" as an abstract framework for complementary pivoting. It gives a unified simple proof that the endpoints of complementary pivoting pa…