Algorithms for covering multiple submodular constraints and applications

Keyphrases

• Greedy Algorithm 100%
• Perovskite Light-emitting Diodes (PeLEDs) 66%
• Set Covering Problem 66%
• Submodular Cover 66%
• ArXiv 33%
• Weight Function 33%
• Minimum Weight 33%
• Concrete Application 33%
• Finite Ground 33%
• Vertex Cover 33%
• High-level Model 33%
• Submodularity 33%
• Mathematical Programming 33%
• Monotone Submodular Functions 33%
• Covering Problem 33%
• Coverage Functions 33%
• Clustering with Outliers 33%
• Geometric Covering Problems 33%
• Covering Integer Programs 33%
• Bicriteria Approximation Algorithms 33%
• Partial Set Cover 33%

Mathematics

• Greedy Algorithm 100%
• Covering Problem 66%
• Set Point 33%
• Integer 33%
• Mathematical Programming 33%
• Weight Function 33%
• Level Model 33%
• Bicriteria 33%
• Partial Set 33%
• Outlier 33%

Computer Science

• Approximation (Algorithm) 100%
• Greedy Algorithm 100%
• Approximation Algorithms 33%
• Integer Multiple 33%
• Integer Program 33%
• Mathematical Programming 33%