Independence and coloring problems on intersection graphs of disks

Abstract

In the paper are condidered various appriximation algorithms for the maximum independent set and minimal coloring problems for the class of disk graphs.

Keywords

• Independence
• coloring
• problems
• intersection
• graphs
• disks