1 citations · 1 across the 4 of their papers we have counts for
4 papers
Cluster Vertex Deletion on Chordal Graphs
Yixin Cao, Peng Li
We present a polynomial-time algorithm for the cluster vertex deletion problem on chordal graphs, resolving an open question posed in different contexts by Cao et al. [Theoretical…
Algorithmics and Complexity of Cost-Driven Task Offloading with Submodular Optimization in Edge-Cloud Environments
Longkun Guo, Jiawei Lin, Xuanming Xu +1
Emerging applications such as autonomous driving pose the challenge of efficient cost-driven offloading in edge-cloud environments. This involves assigning tasks to edge and cloud…
On the Complexity of Detecting Constrained Negative Cost Cycles
Longkun Guo, Peng Li
Given a positive integer and a directed graph with a cost on each edge, the -length negative cost cycle (\emph{LNCC}) problem is to determine whether there exists a negat…
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…