Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Submodular Maximization under Supermodular Constraint: Greedy Guarantees
Ajitesh Srivastava, Shanghua Teng
Motivated by a wide range of applications in data mining and machine learning, we consider the problem of maximizing a submodular function subject to supermodular cost constraints.…
cs.DS2024
Overcoming Non-Submodularity: Towards Constant Approximation for Network Immunization
Ajitesh Srivastava, Shang-Hua Teng
Given a network with an ongoing epidemic, the network immunization problem seeks to identify a fixed number of nodes to immunize in order to maximize the number of infections preve…