Approximation algorithms for euler genus and related problems

Keyphrases

• Approximation Algorithms 100%
• Euler Genus 100%
• Bounded Degree Graphs 50%
• Crossing number 33%
• Logos 33%
• Algorithm Design 16%
• NP-hard 16%
• Polynomial-time Algorithm 16%
• Graph Topology 16%
• Further Application 16%
• Graph Theory 16%
• Edge Deletion 16%
• Approximation Ratio 16%
• Fixed-parameter Tractability 16%
• 2-approximation 16%
• Correctness Proofs 16%
• Orientable Genus 16%
• Theory of Computing 16%
• Edge Deletion Problems 16%
• Vertex Deletion Problems 16%
• Numbers Problem 16%
• Genus of a Graph 16%
• Vertex Deletion 16%

Mathematics

• Edge 100%
• Crossing Number 100%
• Upper Bound 50%
• Polynomial Time 50%
• Approximability 50%
• Proof Of Correctness 50%
• Design of algorithm 50%