02560oam 2200445zu 450 991087268550332120241212215246.010.1109/ISPAN.2004(CKB)1000000000021815(SSID)ssj0000558648(PQKBManifestationID)12250545(PQKBTitleCode)TC0000558648(PQKBWorkID)10565644(PQKB)10674897(NjHacI)991000000000021815(EXLCZ)99100000000002181520160829d2004 uy engur|||||||||||txtccrParallel Architectures, Algorithms and Networks (I-SPAN 2004): Proceedings, 7th International Symposium, Hong Kong, 2004[Place of publication not identified]IEEE Computer Society Press20041 online resource (xvi, 645 pages) illustrationsBibliographic Level Mode of Issuance: Monograph9780769521350 0769521355 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 battle-field 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.Computer algorithmsCongressesParallel processing (Electronic computers)CongressesComputer algorithmsParallel processing (Electronic computers)005.1Hsu D. Frank(Derbiau Frank),1948-58933PQKBPROCEEDING9910872685503321Parallel Architectures, Algorithms and Networks (I-SPAN 2004): Proceedings, 7th International Symposium, Hong Kong, 20042378638UNINA