O(log k)-approx for Cap-k-ECSS and constant 7-approx for (1,q)-FGC via knapsack-cover inequalities plus small-cuts covering.
A Factor 2 Approximation Algorithm for the G eneralized Steiner Network Problem
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2representative citing papers
Obtains a tight competitive ratio for the online Connectivity Augmentation Problem, improving prior bounds.
citing papers explorer
-
Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
O(log k)-approx for Cap-k-ECSS and constant 7-approx for (1,q)-FGC via knapsack-cover inequalities plus small-cuts covering.