Login / Signup
Large-deviation Properties of Linear-programming Computational Hardness of the Vertex Cover Problem.
Satoshi Takabe
Koji Hukushima
Alexander K. Hartmann
Published in:
CoRR (2018)
Keyphrases
</>
vertex cover
linear programming
large deviations
mathematical programming
approximation algorithms
np hard
planar graphs
image segmentation
worst case
learning algorithm
dynamic programming
state space
probability density function
generalization bounds