Linear time algorithm for 1-center in Rd under convex polyhedral distance function
Document Type
Conference Article
Publication Title
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abstract
In this paper we present algorithms for computing 1-center of a set of points for convex polyhedral distance function in Rd for any d. Given polyhedral P of size m, the running time of our algorithm for computing 1-center of n points in R2 for convex polygonal distance function dP is O(nm log2 m). For d > 2, we present an O(33d2 nm2 logd m) algorithm to compute 1-center of n points in Rd for convex polyhedral distance function dP, |P| = m. Both the algorithms are linear time for fixed d and fixed polyhedron P.
First Page
41
Last Page
52
DOI
10.1007/978-3-319-39817-4_5
Publication Date
1-1-2016
Recommended Citation
Das, Sandip; Nandy, Ayan; and Sarvottamananda, Swami, "Linear time algorithm for 1-center in Rd under convex polyhedral distance function" (2016). Conference Articles. 736.
https://digitalcommons.isical.ac.in/conf-articles/736
