This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms find approximate (slightly suboptimal) solutions to optimization ...
The travelling salesman problem (TSP) remains one of the most challenging NP‐hard problems in combinatorial optimisation, with significant implications for logistics, network design and route planning ...
Transactions of the American Mathematical Society, Vol. 223 (Oct., 1976), pp. 103-131 (29 pages) This paper demonstrates a Remez exchange algorithm applicable to approximation of real-valued ...
After 44 years, there’s finally a better way to find approximate solutions to the notoriously difficult traveling salesperson problem. When Nathan Klein started graduate school two years ago, his ...
Mark Jerrum, Alistair Sinclair (UC Berkeley) and Eric Vigoda (Georgia Tech) received the Association for Computing Machinery (ACM) Test of Time Award at a virtual ceremony on Wednesday 23 June at the ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback