Login / Signup
Nearly linear time approximations for mixed packing and covering problems without data structures or randomization.
Kent Quanrud
Published in:
SOSA (2020)
Keyphrases
</>
data structure
worst case
optimization problems
np complete
privacy preserving
decision problems
databases
information retrieval
artificial intelligence
database systems
benchmark problems
packing problem