19 citations · 24 across the 16 of their papers we have counts for
6 papers · 1 filter
A Deterministic -Approximation for Non-monotone Submodular Maximization under Matroid Constraints
Shengminjie Chen, Kaifeng Lin, Xiaoming Sun +1
Submodular maximization arises in a wide range of combinatorial optimization problems and has been extensively studied from the perspective of approximation algorithms. For maximiz…
Deterministic Algorithm for Non-monotone Submodular Maximization under Matroid and Knapsack Constraints
Shengminjie Chen, Yiwei Gao, Kaifeng Lin +2
Submodular maximization constitutes a prominent research topic in combinatorial optimization and theoretical computer science, with extensive applications across diverse domains. W…
Efficient Deterministic Algorithms for Maximizing Symmetric Submodular Functions
Zongqi Wan, Jialin Zhang, Xiaoming Sun +1
Symmetric submodular maximization is an important class of combinatorial optimization problems, including MAX-CUT on graphs and hyper-graphs. The state-of-the-art algorithm for the…
Improved Deterministic Streaming Algorithms for Non-monotone Submodular Maximization
Xiaoming Sun, Jialin Zhang, Shuo Zhang
Submodular maximization is one of the central topics in combinatorial optimization. It has found numerous applications in the real world. Streaming algorithms for submodule maximiz…
Improved Deterministic Algorithms for Non-monotone Submodular Maximization
Xiaoming Sun, Jialin Zhang, Shuo Zhang +1
Submodular maximization is one of the central topics in combinatorial optimization. It has found numerous applications in the real world. In the past decades, a series of algorithm…
Simple Deterministic Approximation for Submodular Multiple Knapsack Problem
Xiaoming Sun, Jialin Zhang, Zhijie Zhang
Submodular maximization has been a central topic in theoretical computer science and combinatorial optimization over the last decades. Plenty of well-performed approximation algori…