3 citations · 5 across the 7 of their papers we have counts for
4 papers · 1 filter
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…
A Parameterized Approximation Algorithm for The Shallow-Light Steiner Tree Problem
Longkun Guo, Kewen Liao
For a given graph with a terminal set and a selected root , a positive integer cost and a delay on every edge and a delay constraint , the shal…
Constrained Fault-Tolerant Resource Allocation
Kewen Liao, Hong Shen, Longkun Guo
In the Constrained Fault-Tolerant Resource Allocation (FTRA) problem, we are given a set of sites containing facilities as resources, and a set of clients accessing these resources…
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…