O(1)-approximations for maximum movement problems

Keyphrases

• Pebbles 100%
• Movement Problems 100%
• Tight 50%
• Graph Connectivity 50%
• Reconfiguration 50%
• Connected Subgraphs 50%
• Steiner Tree 50%
• P-NP 50%
• 2-approximation 50%
• Approximation Factor 50%
• Problem Model 50%
• Constant-factor Approximation Algorithm 50%
• Radio Networks 50%
• Swarm Robots 50%

Computer Science

• Approximation (Algorithm) 100%
• Constant Factor 100%
• Robot 50%
• Approximation Algorithms 50%
• steiner tree 50%
• approximation factor 50%