Anticipatory bound selection procedure (ABSP) for vertex K-center problem
Joint Authors
Source
The International Arab Journal of Information Technology
Issue
Vol. 11, Issue 5 (30 Sep. 2014)8 p.
Publisher
Publication Date
2014-09-30
Country of Publication
Jordan
No. of Pages
8
Main Subjects
Information Technology and Computer Science
Topics
Abstract EN
Vertex K-center problem introduces the notion to recognize k locations as centers in a given network of connected ondition of triangle inequality.
This paper presents an efficient algorithm that provides a better solution for balm.
Anticipatory Bound Selection Procedure (ABSP) is deployed to find the initial threshold distance (or radius) and eradicating the gap between minimum distance (lower bound) and maximum distance (upper bound).
The jump based scheme is applied to find the optimal coverage distance.
Main aspect of this algorithm is to provide optimal solution with less iteration which has not been achieved so far.
American Psychological Association (APA)
Ran, Rattan& Garg, Deepak. 2014. Anticipatory bound selection procedure (ABSP) for vertex K-center problem. The International Arab Journal of Information Technology،Vol. 11, no. 5.
https://search.emarefa.net/detail/BIM-360385
Modern Language Association (MLA)
Ran, Rattan& Garg, Deepak. Anticipatory bound selection procedure (ABSP) for vertex K-center problem. The International Arab Journal of Information Technology Vol. 11, no. 5 (Sep. 2014).
https://search.emarefa.net/detail/BIM-360385
American Medical Association (AMA)
Ran, Rattan& Garg, Deepak. Anticipatory bound selection procedure (ABSP) for vertex K-center problem. The International Arab Journal of Information Technology. 2014. Vol. 11, no. 5.
https://search.emarefa.net/detail/BIM-360385
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-360385