Independent Sets in Elimination Graphs with a Submodular Objective

Keyphrases

• Disk-shaped 100%
• Intersection Graph 100%
• Maximum Weight Independent Set 100%
• Independent Graph 100%
• Greedy Algorithm 50%
• Geometric Shape 50%
• Deterministic Algorithm 50%
• Randomized Algorithms 50%
• Monotone 50%
• Approximation Ratio 50%
• Degenerate Graphs 50%
• Constant-factor Approximation Algorithm 50%
• Graph Classes 50%
• Submodular Function 50%
• Adaptivity 50%
• Orientable 50%
• Chordal Graph 50%
• Primal-dual Algorithm 50%
• Multilinear Relaxation 50%
• Contention Resolution Schemes 50%
• Streaming Algorithms 50%

Mathematics

• Independent Set 100%
• Intersection Graph 50%
• Greedy Algorithm 25%
• Degenerate Graph 25%
• Constant Factor 25%
• Resolution Scheme 25%