Solving NP-hard semirandom graph problems in polynomial expected time.
Amin Coja-OghlanPublished in: J. Algorithms (2007)
Keyphrases
- np hard
- np complete
- solving problems
- decision problems
- np hard problems
- optimization problems
- random walk
- combinatorial optimization
- optimal solution
- np complete problems
- exact methods
- branch and bound algorithm
- algebraic equations
- solving complex
- np hardness
- graph representation
- integer programming
- scheduling problem
- lower bound