Generalized submodular cover problems and applications

Keyphrases

• Covering Problem 100%
• Logarithmic Ratio 100%
• Submodular Cover 100%
• Approximation Algorithms 66%
• P-NP 66%
• Greedy Approach 66%
• Approximation Ratio 33%
• NP-hard Problem 33%
• Selection Problem 33%
• Minimum Weight 33%
• Approximate Solution 33%
• Spanning Tree 33%
• First Problem 33%
• New Center 33%
• Center Selection 33%

Mathematics

• NP-hard Problem 100%
• Wide Class 100%
• Approximate Solution 100%
• Spanning Tree 100%