Title of article
Disjoint paths in sparse graphs Original Research Article
Author/Authors
Cédric Bentz، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
11
From page
3558
To page
3568
Abstract
We generalize all the results obtained for maximum integer multiflow and minimum multicut problems in trees by Garg, Vazirani and Yannakakis [N. Garg, V.V. Vazirani, M. Yannakakis, Primal-dual approximation algorithms for integral flow and multicut in trees, Algorithmica 18 (1997) 3–20] to graphs with a fixed cyclomatic number, while this cannot be achieved
Keywords
Disjoint paths , Approximation algorithms , Planar graphs , Bounded tree-width , Polynomial-time solvability
Journal title
Discrete Applied Mathematics
Serial Year
2009
Journal title
Discrete Applied Mathematics
Record number
887291
Link To Document