## 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 ∈ ℤ^{+}_{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 pseudopolynomial-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 + ln1/γ)) for any fixed γ > 0 [3, 5]. To the best of our knowledge, this is the first constant-factor algorithm that almost strictly obeys kRSP constraint.

Original language | English |
---|---|

Title of host publication | SPAA 2015 - Proceedings of the 27th ACM Symposium on Parallelism in Algorithms and Architectures |

Publisher | Association for Computing Machinery (ACM) |

Pages | 62-64 |

Number of pages | 3 |

Volume | 2015 |

ISBN (Electronic) | 9781450335881 |

DOIs | |

Publication status | Published - 13 Jun 2015 |

Externally published | Yes |

Event | 27th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015 - Portland, United States Duration: 13 Jun 2015 → 15 Jun 2015 |

### Conference

Conference | 27th ACM Symposium on Parallelism in Algorithms and Architectures, SPAA 2015 |
---|---|

Country | United States |

City | Portland |

Period | 13/06/15 → 15/06/15 |