16 citations · 59 across the 25 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.DS2021
On a Partition LP Relaxation for Min-Cost 2-Node Connected Spanning Subgraphs
Logan Grout, Joseph Cheriyan, Bundit Laekhanukit
Our motivation is to improve on the best approximation guarantee known for the problem of finding a minimum-cost 2-node connected spanning subgraph of a given undirected graph with…
cs.DS2021★ 1 cited
Polynomial Integrality Gap of Flow LP for Directed Steiner Tree
Shi Li, Bundit Laekhanukit
In the Directed Steiner Tree (DST) problem, we are given a directed graph on vertices with edge-costs , a root vertex , and a se…