Brief announcement: efficient approximation algorithms for computing k disjoint restricted shortest paths
Files
(Restricted Access)
Date
2015
Authors
Guo, L.
Shen, H.
Liao, K.
Li, P.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
Proceedings of the 27th ACM symposium on Parallelism in Algorithms and Architectures, 2015, vol.2015-June, pp.62-64
Statement of Responsibility
Longkun Guo, Kewen Liao
Conference Name
27th ACM symposium on Parallelism in Algorithms and Architectures (SPAA) (13 Jun 2015 - 15 Jun 2015 : Portland, OR)
Abstract
Let G = (V, E) be a digraph with nonnegative integral cost and delay on each edge, s and t be two vertices, and D ∈ Z+ 0 be a delay bound, the k disjoint Restricted Shortest Path (kRSP) problem is to compute k disjoint paths between s and t with the total cost minimized and the total delay bounded by D. In this paper, we first present a pseudo- polynomial-time algorithm with a bifactor approximation ratio of (1, 2), then improve the algorithm to polynomial time with a bifactor ratio of (1+∈, 2+∈) for any fixed ǫ > 0, which is better than the current best approximation ratio (O(1 + γ),O(1 + ln ¹ )) for any fixed γ > 0 [3, 5]. To the best of our knowledge, this is the first constant-factor algo- rithm that almost strictly obeys kRSP constraint.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright is held by the owner/author(s). Publication rights licensed to ACM