TY - CHAP
T1 - Geometric optimization revisited
AU - Agarwal, Pankaj K.
AU - Ezra, Esther
AU - Fox, Kyle
N1 - Publisher Copyright: © Springer Nature Switzerland AG 2019.
PY - 2019
Y1 - 2019
N2 - 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.
AB - 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.
UR - https://www.scopus.com/pages/publications/85087438317
U2 - 10.1007/978-3-319-91908-9_5
DO - 10.1007/978-3-319-91908-9_5
M3 - فصل
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 66
EP - 84
BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ER -