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 ...
Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer to the for-credit experience when you ...
Not long ago, a team of researchers from Stanford and McGill universities broke a 35-year record in computer science by an almost imperceptible margin — four hundredths of a trillionth of a trillionth ...
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 ...
New research from the University of Waterloo is making inroads on one of the biggest problems in theoretical computer science. But the way to do it, according to Cameron Seth, a Ph.D. researcher ...
Nathan Klein receives funding from the National Science Foundation. Computers are good at answering questions. What’s the shortest route from my house to Area 51? Is 8,675,309 a prime number? How many ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback