3 citations · 14 across the 18 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.DS2022
Approximation algorithms for covering vertices by long paths
Mingyang Gong, Brett Edgar, Jing Fan +2
Given a graph, the general problem to cover the maximum number of vertices by a collection of vertex-disjoint long paths seemingly escapes from the literature. A path containing at…
cs.DS2022
An efficient polynomial-time approximation scheme for parallel multi-stage open shops
Jianming Dong, Ruyan Jin, Guohui Lin +3
Various new scheduling problems have been arising from practical production processes and spawning new research areas in the scheduling field. We study the parallel multi-stage ope…