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 ...
In this paper we introduce two general techniques for the design and analysis of approximation algorithms for NP-hard scheduling problems in which the objective is to minimize the weighted sum of the ...
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 ...
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 ...
Results that may be inaccessible to you are currently showing.
Hide inaccessible results
Feedback