Geometric optimisation and approximation algorithms form a vibrant research area that intersects computational geometry ...
Start working toward program admission and requirements right away. Work you complete in the non-credit experience will transfer ...
In recent years approximation algorithms based on primal-dual methods have been successfully applied to a broad class of discrete ...
where for any $F \subseteq V,d(j,F) = \min _{feF} d(j,f)$ . This is a "min-max" or "robust" version of the k-median problem.
This course studies approximation algorithms – algorithms that are used for solving hard optimization problems. Such algorithms ...
Mark Jerrum, Alistair Sinclair (UC Berkeley) and Eric Vigoda (Georgia Tech) received the Association for Computing Machinery (ACM ...
Nash equilibria represent a cornerstone in game theory, defining strategy profiles wherein no player can benefit by unilaterally ...
Idea for Design presents an algorithm for handheld calculators that gives a better approximation of of ripple voltages from a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback