15 citations · 42 across the 17 of their papers we have counts for
13 papers · 1 filter
New Approximation Algorithms for Fair -median Problem
Di Wu, Qilong Feng, Jianxin Wang
The fair -median problem is one of the important clustering problems. The current best approximation ratio is 4.675 for this problem with 1-fair violation, which was proposed by…
Modification Problems toward Proper (Helly) Circular-arc Graphs
Yixin Cao, Jianxin Wang, Hanchun Yuan
We present a -time algorithm for the proper circular-arc vertex deletion problem, resolving an open problem of van 't Hof and Villanger [Algorithmica 2013] and C…
An Improved FPT Algorithm for the Flip Distance Problem
Qilong Feng, Shaohua Li, Xiangzhong Meng +1
Given a set of points in the Euclidean plane and two triangulations of , the flip distance between these two triangulations is the minimum number of flips required…
Characterization and Linear-time Recognition of Paired Threshold Graphs
Guozhen Rong, Yixin Cao, Jianxin Wang
In a paired threshold graph, each vertex has a weight, and two vertices are adjacent if their weight sum is large enough and their weight difference is small enough. It generalizes…
Graph Searches and Their End Vertices
Yixin Cao, Guozhen Rong, Jianxin Wang +1
Graph search, the process of visiting vertices in a graph in a specific order, has demonstrated magical powers in many important algorithms. But a systematic study was only initiat…
On Scheduling Two-Stage Jobs on Multiple Two-Stage Flowshops
Guangwei Wu, Jianer Chen, Jianxin Wang
Motivated by the current research in data centers and cloud computing, we study the problem of scheduling a set of two-stage jobs on multiple two-stage flowshops. A new formulation…