Approximation algorithms for classes of graphs excluding single-crossing graphs as minors

Keyphrases

• Approximation Algorithms 100%
• Bounded Treewidth 100%
• Branchwidth 33%
• Cross Graph 100%
• Edge Dominating Set 33%
• Feedback Vertex Set 33%
• Fixed-parameter Algorithms 33%
• General Graphs 33%
• Large Classes 33%
• Locally Bounded 33%
• Maximization Problem 33%
• Minimization Problem 33%
• Planar Graph 66%
• Polynomial Time Solution 33%
• Polynomial-time Algorithm 33%
• Polynomial-time Approximation Scheme 33%
• Single-crossing 100%
• Structural Properties 66%
• Treewidth 66%
• Vertex Cover 33%

Mathematics

• Branch-width 33%
• Considered Class 33%
• Dominating Set 33%
• Edge Cover 33%
• Planar Graph 66%
• Polynomial Time 100%
• Structural Property 66%