A Factor 2 Approximation Algorithm for the G eneralized Steiner Network Problem

Jain, Kamal · 2001 · DOI 10.1007/s004930170004

2 Pith papers cite this work. Polarity classification is still indexing.

2 Pith papers citing it

open at publisher browse 2 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.

cs.DS · 2026-06-16 · unverdicted · novelty 6.0

Obtains a tight competitive ratio for the online Connectivity Augmentation Problem, improving prior bounds.

Showing 1 of 1 citing paper after filters.

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