Linear Programming Bounds for Randomly Sampling Colorings.
Sitan ChenAnkur MoitraPublished in: CoRR (2018)
Keyphrases
- linear programming
- linear program
- upper bound
- upper and lower bounds
- optimal solution
- lower bound
- graph coloring
- dynamic programming
- quadratic programming
- sample size
- objective function
- sampling strategies
- feasible solution
- integer programming
- random sampling
- variance reduction
- randomly chosen
- lower and upper bounds
- nonlinear programming
- sampling strategy
- np hard
- network flow
- sampled data
- sampling algorithm
- primal dual
- column generation
- optimization problems
- support vector machine
- average case
- worst case
- data sets