Approximating maximum subgraphs without short cycles

Keyphrases

• Maximum Subgraph 100%
• K-cycle 100%
• Approximation Algorithms 50%
• Cycle Transversal 50%
• Cycle-free 37%
• Integrality Gap 37%
• Transversal Problem 25%
• 2-approximation 25%
• Graph Problems 25%
• Number of Vertices 12%
• Vertex Cover Problem 12%
• Approximation Scheme 12%
• Extremal Graph Theory 12%
• Discrete Mathematics 12%
• Small Length 12%
• Undirected Graph 12%
• Hardness of Approximation 12%
• 3-cycle 12%

Mathematics

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