Optimal Geometric Partitions, Covers and K-Centers
Data Structures and Algorithms
2009-08-26 v1 Computational Geometry
Abstract
In this paper we present some new, practical, geometric optimization techniques for computing polygon partitions, 1D and 2D point, interval, square and rectangle covers, as well as 1D and 2D interval and rectangle K-centers. All the techniques we present have immediate applications to several cost optimization and facility location problems which are quite common in practice. The main technique employed is dynamic programming, but we also make use of efficient data structures and fast greedy algorithms.
Cite
@article{arxiv.0908.3652,
title = {Optimal Geometric Partitions, Covers and K-Centers},
author = {Mugurel Ionut Andreica and Eliana-Dina Tirsa and Cristina Teodora Andreica and Romulus Andreica and Mihai Aristotel Ungureanu},
journal= {arXiv preprint arXiv:0908.3652},
year = {2009}
}
Comments
Extended version of the conference paper