Login / Signup
A Tight Approximation for Submodular Maximization with Mixed Packing and Covering Constraints.
Eyal Mizrachi
Roy Schwartz
Joachim Spoerhase
Sumedha Uniyal
Published in:
ICALP (2019)
Keyphrases
</>
objective function
lower bound
upper bound
constraint satisfaction
worst case
greedy algorithm
neural network
case study
high order
approximation algorithms
mixed integer
submodular functions
error tolerance
min sum