2 citations · 4 across the 6 of their papers we have counts for
1 paper · 1 filter
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…