Login / Signup
NP-hardness of polytope M-matrix testing and related problems
Nikos Vlassis
Published in:
CoRR (2012)
Keyphrases
</>
related problems
np hardness
np hard
approximation algorithms
semidefinite
worst case analysis
mixed integer
stable marriage
convex hull
discrete tomography
broadly applicable
integer programming
knapsack problem
scheduling problem
computational complexity
optimal solution
stable set
lattice points
training data