Many combinatorial optimization problems such as set cover, clustering, and graph matching have been formulated in geometric settings. We review the progress made in recent years on a number of such geometric optimization problems, with an emphasis on how geometry has been exploited to develop better algorithms. Instead of discussing many problems, we focus on a few problems, namely, set cover, hitting set, independent set, and computing maps between point sets.
CITATION STYLE
Agarwal, P. K., Ezra, E., & Fox, K. (2019). Geometric optimization revisited. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10000, pp. 66–84). Springer. https://doi.org/10.1007/978-3-319-91908-9_5
Mendeley helps you to discover research relevant for your work.