2 papers
cs.DS2025
Efficient Branch-and-Bound for Submodular Function Maximization under Knapsack Constraint
Yimin Hao, Yi Zhou, Chao Xu +1
The submodular knapsack problem (SKP), which seeks to maximize a submodular set function by selecting a subset of elements within a given budget, is an important discrete optimizat…
cs.IR2025
Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
Zhenxiang Xu, Yiping Liu, Yi Zhou +2
In a bipartite graph, a subgraph is an -biplex if each vertex of the subgraph is adjacent to all but at most vertices on the opposite set. The enumeration of -biplexes fr…