A Lower Bound on Cycle-Finding in Sparse Digraphs.
Xi ChenTim RandolphRocco A. ServedioTimothy SunPublished in: CoRR (2019)
Keyphrases
- lower bound
- upper bound
- optimal solution
- high dimensional
- branch and bound algorithm
- polynomial approximation
- objective function
- branch and bound
- neural network
- np hard
- worst case
- compressive sensing
- sufficiently accurate
- linear programming relaxation
- compressed sensing
- lagrangian relaxation
- sparse representation
- probabilistic model
- special case
- data structure
- genetic algorithm