Streaming Algorithms for Monotone DR-Submodular Maximization Under a Knapsack Constraint on the Integer Lattice .

von Tan, Jingjing
Veröffentlicht in PAAP (11. : 2020 : Shenzhen) Parallel architectures, algorithms and programming (2021)

Maximizing the Sum of a Supermodular Function and a Monotone DR-submodular Function Subject to a Knapsack Constraint on the Integer Lattice

von Tan, Jingjing
Veröffentlicht in CSoNet (10. : 2021 : Online) Computational data and social networks (2021)

Non-Submodular Streaming Maximization with Minimum Memory and Low Adaptive Complexity

von Li, Meixia
Veröffentlicht in AAIM (14. : 2020 : Jinhua; Online) Algorithmic aspects in information and management (2020)

Maximization of Monotone Non-submodular Functions with a Knapsack Constraint over the Integer Lattice

von Tan, Jingjing
Veröffentlicht in COCOA (15. : 2021 : Tianjin) Combinatorial optimization and applications (2021)

An Improved Approximation Algorithm for Capacitated Correlation Clustering Problem

von Ji, Sai
Veröffentlicht in COCOA (15. : 2021 : Tianjin) Combinatorial optimization and applications (2021)

Streaming Algorithms for Maximization of a Non-submodular Function with a Cardinality Constraint on the Integer Lattice

von Tan, Jingjing
Veröffentlicht in PDCAT (22. : 2021 : Kanton, Stadt; Online) Parallel and distributed computing, applications and technologies (2022)

Parallelized Maximization of Nonsubmodular Function Subject to a Cardinality Constraint

von Zhang, Hongxiang
Veröffentlicht in COCOON (26. : 2020 : Online) Computing and combinatorics (2020)