a public good project by the
Synthesis
Company
of California

© 2026

A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem | doi.page

0 citations0 references

Google Scholar doi.org

A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem

COMBINATORICA·2001·Vol. 21(1), pp. 39–60

Citations Over TimeTop 1% of 2001 papers

Related Papers

→ Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs(2001)33 cited
→ Unrelated machine scheduling of jobs with uniform smith ratios(2017)4 cited
→ Unrelated Machine Scheduling of Jobs with Uniform Smith Ratios(2017)3 cited
The Lifted-Cut Relaxation of the Steiner Forest Problem(2007)