Geometric partitioning and robust ad-hoc network design

John Carlsson (), Mehdi Behroozi and Xiang Li

Annals of Operations Research, 2016, vol. 238, issue 1, 68 pages

Abstract: We present fast approximation algorithms for the problem of dividing a given convex geographic region into smaller sub-regions so as to distribute the workloads of a set of vehicles. Our objective is to partition the region in such a fashion as to ensure that vehicles are capable of communicating with one another under limited communication radii. We consider variations of this problem in which sub-regions are constrained to have equal area or be convex, and as a side consequence, our approach yields a factor 1.99 approximation algorithm for the continuous k-centers problem on a convex polygon. Copyright Springer Science+Business Media New York 2016

Keywords: Geometric partitioning; Network design; Location set covering; Vehicle routing; approximation algorithms (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://hdl.handle.net/10.1007/s10479-015-2093-0 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:annopr:v:238:y:2016:i:1:p:41-68:10.1007/s10479-015-2093-0

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10479

DOI: 10.1007/s10479-015-2093-0

Access Statistics for this article

Annals of Operations Research is currently edited by Endre Boros

More articles in Annals of Operations Research from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().