10 citations · 44 across the 21 of their papers we have counts for
Showing 2022 · cs.DSShow all
3 papers · 2 filters
cs.DS2022
Effective Variable Depth Local Search for the Budgeted Maximum Coverage Problem
Jianrong Zhou, Jiongzhi Zheng, Kun He
We address the Budgeted Maximum Coverage Problem (BMCP), which is a natural and more practical extension of the standard 0-1 knapsack problem and the set cover problem. Given m ele…
cs.DS2022
An Efficient Algorithm for the Partitioning Min-Max Weighted Matching Problem
Yuxuan Wang, Jinyao Xie, Jiongzhi Zheng +1
The Partitioning Min-Max Weighted Matching (PMMWM) problem is an NP-hard problem that combines the problem of partitioning a group of vertices of a bipartite graph into disjoint su…
cs.DS2022★ 2 cited
A Strengthened Branch and Bound Algorithm for the Maximum Common (Connected) Subgraph Problem
Jianrong Zhou, Kun He, Jiongzhi Zheng +2
We propose a new and strengthened Branch-and-Bound (BnB) algorithm for the maximum common (connected) induced subgraph problem based on two new operators, Long-Short Memory (LSM) a…