Approximation algorithms for the mobile piercing set problem with applications to clustering in ad-hoc networks

Keyphrases

• Approximation Algorithms 100%
• Piercing Set 100%
• Ad Hoc Networks 100%
• Approximation Factor 40%
• 1-hop 40%
• Centralized Algorithm 40%
• Fully Distributed Algorithm 40%
• Network Topology 20%
• Popular 20%
• Constant Time 20%
• Low Degradation 20%
• Constant-factor Approximation Algorithm 20%
• Unit Disk 20%
• Network Node 20%
• Three-dimensional Space 20%
• Clustering Algorithm 20%
• Alternative Algorithms 20%
• Vector Space 20%
• Better Approximation 20%
• L2 Norm 20%
• Adaptive Change 20%
• Update Time 20%
• Constant Approximation 20%
• Approximation Bound 20%
• Theoretical Performance Analysis 20%
• Multiple Radii 20%
• Decentralized Algorithm 20%
• Fully Decentralized 20%
• Dimension Vector 20%
• Fixed Dimension 20%
• 2-dimensional Space 20%

Computer Science

• Approximation Algorithms 100%
• ad-hoc network 100%
• Approximation (Algorithm) 66%
• Constant Factor 66%
• Dimensional Space 66%
• approximation factor 66%
• Network Topology 33%
• Clustering Algorithm 33%
• Distributed Algorithm 33%
• Performance Analysis 33%
• Vector Dimension 33%

Mathematics

• Constant Factor 100%
• Dimensional Space 100%
• Constant Time 50%
• Minimizes 50%
• Unit Disk 50%
• Nonuniform 50%
• Clustering Algorithm 50%
• Vector Space 50%