Nearly linear-time packing and covering LP solvers - Achieving width-independence and -convergence.

Zeyuan Allen-Zhu Lorenzo Orecchia

Published in: Math. Program. (2019)

Keyphrases

linear programming
linear program
convergence rate
convergence speed
conditional independence
packing problem
data sets
bayesian networks
objective function
special case
np hard
constraint satisfaction
simplex method
simple polygon