most citedImproved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints

3 citations · 4 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

2 papers · 1 filter

cs.DS2013★ 3 cited

Improved Approximation Algorithms for Computing k Disjoint Paths Subject to Two Constraints

Longkun Guo, Hong Shen, Kewen Liao

For a given graph with positive integral cost and delay on edges, distinct vertices and , cost bound and delay bound , the bi-constraint pat…

cs.DS2011★ 1 cited

Unconstrained and Constrained Fault-Tolerant Resource Allocation

Kewen Liao, Hong Shen

First, we study the Unconstrained Fault-Tolerant Resource Allocation (UFTRA) problem (a.k.a. FTFA problem in \cite{shihongftfa}). In the problem, we are given a set of sites equipp…