15 citations · 42 across the 17 of their papers we have counts for
19 papers
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…
Time Complexity Analysis of Evolutionary Algorithms for 2-Hop (1,2)-Minimum Spanning Tree Problem
Feng Shi, Frank Neumann, Jianxin Wang
The Minimum Spanning Tree problem (abbr. MSTP) is a well-known combinatorial optimization problem that has been extensively studied by the researchers in the field of evolutionary…
Parameterized Complexity of Multi-winner Determination: More Effort Towards Fixed-Parameter Tractability
Yongjie Yang, Jianxin Wang
We study the parameterized complexity of winner determination problems for three prevalent -committee selection rules, namely the minimax approval voting (MAV), the proportional…
A Refined Study of the Complexity of Binary Networked Public Goods Games
Yongjie Yang, Jianxin Wang
We study the complexity of several combinatorial problems in the model of binary networked public goods games. In this game, players are represented by vertices in a network, and t…
Cycle Extendability of Hamiltonian Strongly Chordal Graphs
Guozhen Rong, Wenjun Li, Jianxin Wang +1
In 1990, Hendry conjectured that all Hamiltonian chordal graphs are cycle extendable. After a series of papers confirming the conjecture for a number of graph classes, the conjectu…