Longcheng Liu

most citedA local search

4/3

-approximation algorithm for the minimum

3

-path partition problem

2 citations · 2 across the 1 of their papers we have counts for

collaborators

3 papers

cs.DS2018★ 2 cited

A local search $4/3$ -approximation algorithm for the minimum $3$ -path partition problem

Yong Chen, Randy Goebel, Guohui Lin +5

Given a graph $G = (V, E)$ , the $3$ -path partition problem is to find a minimum collection of vertex-disjoint paths each of order at most $3$ to cover all the vertices of $V$ . It i…

cs.DS2018

Approximation algorithms for the three-machine proportionate mixed shop scheduling

Longcheng Liu, Yong Chen, Jianming Dong +6

A mixed shop is a manufacturing infrastructure designed to process a mixture of a set of flow-shop jobs and a set of open-shop jobs. Mixed shops are in general much more complex to…

cs.DS2018

Approximation algorithms for two-machine flow-shop scheduling with a conflict graph

Yinhui Cai, Guangting Chen, Yong Chen +4

Path cover is a well-known intractable problem that finds a minimum number of vertex disjoint paths in a given graph to cover all the vertices. We show that a variant, where the ob…

A local search 4/3-approximation algorithm for the minimum 3-path partition problem

Approximation algorithms for the three-machine proportionate mixed shop scheduling

Approximation algorithms for two-machine flow-shop scheduling with a conflict graph

A local search $4/3$ -approximation algorithm for the minimum $3$ -path partition problem