2 citations · 3 across the 5 of their papers we have counts for
6 papers
Approximation algorithms for the directed path partition problems
Yong Chen, Zhi-Zhong Chen, Curtis Kennedy +3
Given a directed graph , the -path partition problem is to find a minimum collection of vertex-disjoint directed paths each of order at most to cover all the ver…
Approximation algorithms for maximally balanced connected graph partition
Yong Chen, Zhi-Zhong Chen, Guohui Lin +2
Given a simple connected graph , we seek to partition the vertex set into non-empty parts such that the subgraph induced by each part is connected, and the part…
A local search -approximation algorithm for the minimum -path partition problem
Yong Chen, Randy Goebel, Guohui Lin +5
Given a graph , the -path partition problem is to find a minimum collection of vertex-disjoint paths each of order at most to cover all the vertices of . It i…
A local search 2.917-approximation algorithm for duo-preservation string mapping
Yao Xu, Yong Chen, Taibo Luo +1
We study the {\em maximum duo-preservation string mapping} ({\sc Max-Duo}) problem, which is the complement of the well studied {\em minimum common string partition} ({\sc MCSP}) p…
Single machine scheduling with job-dependent machine deterioration
Wenchang Luo, Yao Xu, Weitian Tong +1
We consider the single machine scheduling problem with job-dependent machine deterioration. In the problem, we are given a single machine with an initial non-negative maintenance l…
Approximation algorithms for the vertex happiness
Yao Xu, Peng Zhang, Randy Goebel +1
We investigate the maximum happy vertices (MHV) problem and its complement, the minimum unhappy vertices (MUHV) problem. We first show that the MHV and MUHV problems are a special…