A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Approximability of 3- and 4-Hop Bounded Disjoint Paths Problems
[chapter]

2010
*
Lecture Notes in Computer Science
*

A path is said to be -bounded if it contains at most edges. We consider two types of -bounded disjoint paths problems. In the maximum edge-or node-disjoint path problems MEDP( ) and MNDP( ), the task is to find the maximum number of edge-or node-disjoint -bounded (s, t)-paths in a given graph G with source s and sink t, respectively. In the weighted edge-or node-disjoint path problems WEDP( ) and WNDP( ), we are also given an integer k ∈ N and non-negative edge weights ce ∈ N, e ∈ E, and seek

doi:10.1007/978-3-642-13036-6_16
fatcat:fdm6obkdxvc4bmdqioaxb7pwxm