Abstract
In this paper we present an Ω(nlog n) lower bound proof for several covering problems including the optimal line bipartition problem, min-max covering by two axis parallel rectangles, discrete and continuous two-center problems, two-line center problem, etc. Our proofs are based on using the 'rotational reduce technique' and well-known lower bound for the maximal gap problem.
| Original language | English |
|---|---|
| Pages (from-to) | 17-29 |
| Number of pages | 13 |
| Journal | Journal of Mathematical Modelling and Algorithms |
| Volume | 1 |
| Issue number | 1 |
| DOIs | |
| State | Published - 1 Dec 2002 |
Keywords
- Max-gap problem
- lower bounds
- reductions
ASJC Scopus subject areas
- Modeling and Simulation
- Applied Mathematics