3 citations · 3 across the 1 of their papers we have counts for
1 paper
Bundit Laekhanukit, Shayan Oveis Gharan, Mohit Singh
In the k-arc connected subgraph problem, we are given a directed graph G and an integer k and the goal is the find a subgraph of minimum cost such that there are at least k-arc dis…