Improved Bounds for Randomly Sampling Colorings via Linear Programming.

Sitan Chen Michelle Delcourt Ankur Moitra Guillem Perarnau Luke Postle

Published in: SODA (2019)

Keyphrases

linear programming
upper bound
linear program
lower bound
improved algorithm
sampling strategy
np hard
error bounds
constraint propagation
quadratic programming
neural network
active learning
dynamic programming
vc dimension
upper and lower bounds
sampling methods