Talk page
Title:
Approximation Algorithms for Multidimensional Proximity Problems
Speaker:
Abstract:
While the field of computational geometry has been very successful in the development of efficient algorithms for computational problems in spaces of dimension two and three, many of these algorithms either fail to generalize to higher dimensions or suffer from running times that grow very rapidly as the dimension increases. This has led to interest in approximation algorithms, where an approximation parameter eps > 0 is given, and the algorithm provides a solution that is within a factor of (1 + eps) of the optimum solution.
Link:
Workshop: