44
Randomised Algorithms for NP-hard Problems
Many NP-hard problems can be tackled by randomised algorithms that
compute nearly optimal solutions
with high probability
Examples:
travelling salesman
constraint satisfaction problems, satisfiability
… and many more
![[prev]](icon/prev.gif){kind=icon}
![[next]](icon/next.gif){kind=icon}