学術雑誌論文 An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two

Kawarabayashi, Ken-Ichi  ,  Kobayashi, Yusuke

13 ( 1 )  , pp.1 - 17 , 2016-12 , Association Computing Machinery
ISSN:1549-6325
NII書誌ID(NCID):AA12062871
内容記述
In the maximum edge-disjoint paths problem, we are given a graph and a collection of pairs of vertices, and the objective is to find the maximum number of pairs that can be routed by edge-disjoint paths. An r-approximation algorithm for this problem is a polynomial-time algorithm that finds at least OPT/r edge-disjoint paths, where OPT denotes the maximum possible number of pairs that can be routed in a given instance. For a long time, an O(n½-approximation algorithm has been best known for this problem even if a congestion of two is allowed, that is, each edge is allowed to be used in at most two of the paths. In this article, we give a randomized O(n&frac;37 ċ poly(log n))-approximation algorithm with congestion two. This is the first result that breaks the O(n½)-approximation algorithm. In particular, we prove the following:(1) If we have a (randomized) polynomial-time algorithm for finding Ω(OPT&frac1p /polylog(n)) edge-disjoint paths for some p > 1, then we can give a randomized O(n½-α)-approximation algorithm for the edge-disjoint paths problem by using Rao-Zhou’s algorithm for some α > 0.(2) Based on the Chekuri-Khanna-Shepherd well-linked decomposition, we show that there is a randomized algorithm for finding Ω(OPT¼ /(log n)&frac32;) edge-disjoint paths connecting given terminal pairs with congestion two.Our framework for this algorithm is more general in the following sense. Indeed, the above two ingredients also work for the maximum edge-disjoint paths problem (with congestion one) if there is a (randomized) polynomial-time algorithm for finding Ω(OPT&frac;1p) edge-disjoint paths connecting given terminal pairs for some p > 1.
本文を読む

https://tsukuba.repo.nii.ac.jp/?action=repository_action_common_download&item_id=40619&item_no=1&attribute_id=17&file_no=1

このアイテムのアクセス数:  回

その他の情報