Approximating maximum subgraphs without short cycles

Keyphrases

• Maximum Subgraph 100%
• K-cycle 100%
• Approximation Algorithms 57%
• Cycle Transversal 57%
• Cycle-free 42%
• Integrality Gap 42%
• Transversal Problem 28%
• 2-approximation 28%
• Graph Problems 28%
• 3-cycle 28%
• Vertex Cover Problem 14%
• Approximation Scheme 14%
• Extremal Graph Theory 14%
• Discrete Mathematics 14%
• Small Length 14%
• Hardness of Approximation 14%

Mathematics

• Transversals 100%
• Edge 50%
• Main Result 25%
• Open Problem 25%
• Intersects 25%
• Triangle 25%
• Running Time 25%
• Covering Problem 25%
• Integer 25%
• Extremal Graph Theory 25%
• Discrete Mathematics 25%