loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04)
Approximation Algorithms Design for Disk Partial Covering Problem
Hong Kong, SAR, China
May 10-May 12
ISBN: 0-7695-2135-5
ASCII Text
x 
 
Bin Xiao, Jiannong Cao, Qingfeng Zhuge, Yi He, Edwin H.-M. Sha, "Approximation Algorithms Design for Disk Partial Covering Problem," Parallel Architectures, Algorithms, and Networks, International Symposium on, pp. 104, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004.
 
 
BibTex
x
 
@article{ 10.1109/ISPAN.2004.1300466,
author = {Bin Xiao and Jiannong Cao and Qingfeng Zhuge and Yi He and Edwin H.-M. Sha},
title = {Approximation Algorithms Design for Disk Partial Covering Problem},
journal ={Parallel Architectures, Algorithms, and Networks, International Symposium on},
volume = {0},
year = {2004},
issn = {1087-4089},
pages = {104},
doi = {http://doi.ieeecomputersociety.org/10.1109/ISPAN.2004.1300466},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Parallel Architectures, Algorithms, and Networks, International Symposium on
TI - Approximation Algorithms Design for Disk Partial Covering Problem
SN - 1087-4089
SP
EP
A1 - Bin Xiao,
A1 - Jiannong Cao,
A1 - Qingfeng Zhuge,
A1 - Yi He,
A1 - Edwin H.-M. Sha,
PY - 2004
KW - null
VL - 0
JA - Parallel Architectures, Algorithms, and Networks, International Symposium on
ER -
 
Bin Xiao, Hong Kong Polytechnic University
Jiannong Cao, Hong Kong Polytechnic University
Qingfeng Zhuge, University of Texas at Dallas
Yi He, University of Texas at Dallas
Edwin H.-M. Sha, University of Texas at Dallas
Mobile servers are established to provide services for mobile nodes in an anticipated area. If the distribution of mobile nodes can be foreseen, the location of mobile servers becomes critical to the QoS of wireless systems. Under resource and topology constraints, it is very difficult to figure out a solution, or unable to cover all given mobile nodes within limited number of mobile servers. In this paper, we study the issue of the partial covering problem such that part of mobile nodes to be covered. Several approximation algorithms are proposed to cover the maximum number of elements. For real time systems, such as the battlefield communication system, the proposed algorithms with polynomial-time complexity can be efficiently applied. The algorithm complexity analysis illustrates the improvement made by our algorithms. The experimental results show that the performance of our algorithms is much better than other existing 3-approximation algorithm for the robust k-center problem.
Citation:
Bin Xiao, Jiannong Cao, Qingfeng Zhuge, Yi He, Edwin H.-M. Sha, "Approximation Algorithms Design for Disk Partial Covering Problem," ispan, pp.104, 2004 International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'04), 2004
Usage of this product signifies your acceptance of the Terms of Use.