2 citations · 4 across the 7 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DS2017★ 1 cited
On the NP-hardness of scheduling with time restrictions
An Zhang, Yong Chen, Lin Chen +1
In a recent paper, Braun, Chung and Graham [1] have addressed a single-processor scheduling problem with time restrictions. Given a fixed integer , there is a set of jobs…
cs.DS2017
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…