Disjoint paths in sparse graphs

0Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

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 for other classical generalizations of trees. We also introduce thek-edge-outerplanar graphs, a class of planar graphs with arbitrary (but bounded) tree-width that generalizes the cacti, and show that the integrality gap of the maximum edge-disjoint paths problem is bounded in these graphs. © 2009 Elsevier B.V. All rights reserved.

Cite

CITATION STYLE

APA

Bentz, C. (2009). Disjoint paths in sparse graphs. Discrete Applied Mathematics, 157(17), 3558–3568. https://doi.org/10.1016/j.dam.2009.03.009

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free