Improvement of Submodular Maximization Problems With Routing Constraints via Submodularity and Fourier Sparsity

Keyphrases

• Cost-benefit 100%
• Maximization Problem 100%
• Submodularity 100%
• Routing Constraint 100%
• Submodular Maximization 100%
• Generalized Cost 100%
• Fourier Sparsity 100%
• Sparsity 33%
• Tree Structure 33%
• NP-hard Problem 33%
• Robotics 33%
• Fourier 33%
• Algorithm Performance 33%
• Optimal Performance 33%
• Benchmark Approach 33%
• Spatial Search 33%
• Environmental Monitoring 33%
• Traveling Salesman Problem 33%
• Support Set 33%
• Routing Tree 33%
• Map Search 33%
• Maximum Coverage 33%

Computer Science

• Sparsity 100%
• Approximation (Algorithm) 50%
• Optimal Performance 50%
• Spatial Search 50%
• Tree Algorithm 50%
• Algorithm Performance 50%
• Traveling Salesman Problem 50%

Engineering

• Sparsity 100%
• Optimal Performance 50%