3 citations · 5 across the 7 of their papers we have counts for
7 papers
Approximation Algorithm for Constrained -Center Clustering: A Local Search Approach
Chaoqi Jia, Longkun Guo, Kewen Liao +3
Clustering is a long-standing research problem and a fundamental tool in AI and data analysis. The traditional k-center problem, a fundamental theoretical challenge in clustering,…
Near-Optimal Algorithms for Constrained k-Center Clustering with Instance-level Background Knowledge
Longkun Guo, Chaoqi Jia, Kewen Liao +2
Center-based clustering has attracted significant research interest from both theory and practice. In many practical applications, input data often contain background knowledge tha…
Efficient Approximation Algorithms for Computing \emph{k} Disjoint Restricted Shortest Paths
Longkun Guo, Kewen Liao, Hong Shen +1
Network applications, such as multimedia streaming and video conferencing, impose growing requirements over Quality of Service (QoS), including bandwidth, delay, jitter, etc. Meanw…
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…