Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
| Publisher | Springer |
| Pages | 66-84 |
| Number of pages | 19 |
| DOIs | |
| State | Published - 2019 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 10000 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Bibliographical note
Publisher Copyright:© Springer Nature Switzerland AG 2019.
Funding
P.K. Agarwal and K. Fox are supported in part by NSF under grants CCF-15-13816, CCF-15-46392, and IIS-14-08846, by ARO grant W911NF-15-1-0408, and by grant 2012/229 from the U.S.-Israel Binational Science Foundation. E. Ezra is supported in part by NSF CAREER under grant CCF-15-53354, and by Grant 824/17 from the Israel Science Foundation.
| Funders | Funder number |
|---|---|
| National Science Foundation | CCF-15-46392, CCF-15-13816, IIS-14-08846 |
| Army Research Office | 2012/229, W911NF-15-1-0408 |
| United States-Israel Binational Science Foundation | 824/17, CCF-15-53354 |
| Israel Science Foundation |