Primal-dual approximation algorithms for integral flow and multicut in trees
Algorithmica1997Vol. 18(1), pp. 3–20
Citations Over TimeTop 10% of 1997 papers
Related Papers
- → The Maximum Flow and Minimum Cost–Maximum Flow Problems: Computing and Applications(2020)6 cited
- → On approximating minimum vertex cover for graphs with perfect matching(2005)16 cited
- → Approximation algorithm for weighted weak vertex cover(2004)10 cited
- → Private Approximation of Clustering and Vertex Cover(2007)9 cited
- → On Approximating Minimum Vertex Cover for Graphs with Perfect Matching(2000)7 cited