Codes, Lower Bounds, and Phase Transitions in the Symmetric Rendezvous Problem.
Varsha DaniThomas P. HayesCristopher MooreAlexander RussellPublished in: CoRR (2016)
Keyphrases
- phase transition
- lower bound
- rendezvous search
- random instances
- upper bound
- constraint satisfaction
- random constraint satisfaction problems
- satisfiability problem
- randomly generated
- np complete
- combinatorial problems
- np hard
- sat problem
- branch and bound algorithm
- branch and bound
- objective function
- finding optimal
- hard problems
- optimal solution
- cellular automata
- max sat
- vc dimension
- random graphs
- np complete problems
- stochastic local search
- dynamic programming
- constraint satisfaction problems