## Abstract

Helly's theorem says that if every d + 1 elements of a given finite set of convex objects in ℝ^{d} have a common point, then there is a point common to all of the objects in the set. We define three new types of Helly theorems: discrete Helly theorems - where the common point should belong to an a-priori given set, lexicographic Helly theorems - where the common point should not be lexicographically greater than a given point, and lexicographic-discrete Helly theorems. We show the relations between these new Helly theorems and their corresponding (standard) Helly theorems. We obtain several new discrete and lexicographic Helly numbers. Using these new types of Helly theorems we get linear time solutions for various optimization problems. For this, we define a new framework, DLP-type (Discrete Linear Programming type), and provide new algorithms that solve in randomized linear time fixed-dimensional DLP-type problems. We show that the complexity of the DLP-type class stands somewhere between Linear Programming (LP) and Integer Programming (IP). Finally, we use our results in order to solve in randomized linear time problems such as the discrete p-center on the real line, the discrete weighted 1-center problem in ℝ^{d} with l_{∞} norm, the standard (continuous) problem of finding a line transversal for a totally separable set of planar convex objects, a discrete version of the problem of finding a line transversal for a set of axis-parallel planar rectangles, and the (planar) lexicographic rectilinear p-center problem for p = 1,2,3. These are the first known linear time algorithms for these problems.

Original language | English |
---|---|

Pages (from-to) | 463-472 |

Number of pages | 10 |

Journal | Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS |

State | Published - 2004 |

Externally published | Yes |

Event | Proceedings - 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2004 - Rome, Italy Duration: 17 Oct 2004 → 19 Oct 2004 |