Optimal Geometric Partitions, Covers and K-Centers

Details Optimal Geometric Partitions, Covers and K-Centers Optimal Geometric Partitions, Covers and K-Centers

2009-08-25

arxiv.org/abs/0908.3652v1

Proc. of the 9th WSEAS Intl. Conf. on Mathematics and Computers in Business and Economics (MCBE), pp. 173-178, Bucharest, Roma

Computer Science

Data Structures and Algorithms

Extended version of the conference paper

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Optimal Geometric Partitions, Covers and K-Centers does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Optimal Geometric Partitions, Covers and K-Centers, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Optimal Geometric Partitions, Covers and K-Centers will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-233555