Boyd, Joseph Cheriyan, Arash Haddadan, and Sha rat Ibrahimpur

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

open at publisher browse 1 citing papers

representative citing papers

cs.DS · 2024-11-27 · conditional · novelty 7.0

O(log k)-approx for Cap-k-ECSS and constant 7-approx for (1,q)-FGC via knapsack-cover inequalities plus small-cuts covering.

Showing 1 of 1 citing paper.

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity cs.DS · 2024-11-27 · conditional · none · ref 6
O(log k)-approx for Cap-k-ECSS and constant 7-approx for (1,q)-FGC via knapsack-cover inequalities plus small-cuts covering.