74 citations · 115 across the 14 of their papers we have counts for
4 papers · 1 filter
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…
On Generality and Knowledge Transferability in Cross-Domain Duplicate Question Detection for Heterogeneous Community Question Answering
Mohomed Shazan Mohomed Jabbar, Luke Kumar, Hamman Samuel +4
Duplicate question detection is an ongoing challenge in community question answering because semantically equivalent questions can have significantly different words and structures…
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…
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…