Approximation algorithms for B₁-EPG graphs

Keyphrases

• Approximation Algorithms 100%
• EPG Graph 100%
• NP-complete 33%
• Motivation 16%
• Optimization Problem 16%
• Polynomial Time 16%
• Coloring Problem 16%
• Simple Path 16%
• Rectangular Grid 16%
• Layout Problem 16%
• Grid Graph 16%
• Single Bend 16%
• Maximum Clique Problem 16%
• Maximum Independent Set Problem 16%
• Edge Intersection Graphs 16%
• Circuit Layout 16%
• Paths on a Grid 16%

Computer Science

• Approximation Algorithms 100%
• Optimization Problem 50%
• Polynomial Time 50%
• Independent Set 50%
• Coloring Problem 50%
• Intersection Graph 50%
• Practical Interest 50%
• Integrated Circuit Layout 50%

Mathematics

• Edge 100%
• Polynomial Time 50%
• Concludes 50%
• Maximum Independent Set 50%
• Clique 50%
• Intersection Graph 50%