Optimal Geometric Partitions, Covers and K-Centers - Archive ouverte HAL Access content directly
Conference Papers Year : 2008

Optimal Geometric Partitions, Covers and K-Centers

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.
Fichier principal
Vignette du fichier
wseas-mcbe2008_Opt_Geom_Part_Covers_K-Centers.pdf (122.65 Ko) Télécharger le fichier
sources_and_text.zip (13.63 Mo) Télécharger le fichier
Origin : Explicit agreement for this submission
Format : Other
Loading...

Dates and versions

hal-00466868 , version 1 (25-03-2010)

Identifiers

  • HAL Id : hal-00466868 , version 1

Cite

Mugurel Ionut Andreica, Eliana-Dina Tirsa, Cristina Teodora Andreica, Romulus Andreica, Mihai Aristotel Ungureanu. Optimal Geometric Partitions, Covers and K-Centers. Proceedings of the 9th WSEAS International Conference on Mathematics and Computers in Business and Economics (MCBE) (ISBN: 978-960-6766-76-3 / ISSN: 1790-5109), Jun 2008, Bucharest, Romania. pp.173-178. ⟨hal-00466868⟩
39 View
63 Download

Share

Gmail Facebook X LinkedIn More