Abstract
Separators in graphs are instrumental in the design of algorithms, having proven to be the key technical tool in approximation algorithms for many optimization problems. In the geometric setting, this naturally translates into the study of separators in the intersection graphs of geometric objects. Recently a number of new separator theorems have been proven for the case of geometric objects in the plane. In this paper we present a new separator theorem that unifies and generalizes some earlier results.
| Original language | English (US) |
|---|---|
| Pages | 380-385 |
| Number of pages | 6 |
| State | Published - 2014 |
| Event | 26th Canadian Conference on Computational Geometry, CCCG 2014 - Halifax, Canada Duration: Aug 11 2014 → Aug 13 2014 |
Other
| Other | 26th Canadian Conference on Computational Geometry, CCCG 2014 |
|---|---|
| Country/Territory | Canada |
| City | Halifax |
| Period | 8/11/14 → 8/13/14 |
ASJC Scopus subject areas
- Geometry and Topology
- Computational Mathematics