Approximation Algorithms for Size-Constrained Non-Monotone Submodular Maximization in Deterministic Linear Time.
Yixin ChenAlan KuhnlePublished in: KDD (2023)
Keyphrases
- approximation algorithms
- worst case
- randomized algorithms
- constant factor
- np hard
- facility location problem
- constant factor approximation
- submodular functions
- upper bound
- special case
- objective function
- greedy algorithm
- minimum cost
- vertex cover
- network design problem
- approximation guarantees
- set cover
- approximation ratio
- lower bound
- approximation schemes
- computational complexity
- disjoint paths
- open shop
- error bounds
- np hardness
- primal dual
- precedence constraints
- exact algorithms
- polynomial time approximation
- undirected graph
- energy minimization