About this document

Graph Coloring in Scheduling Problems by Anushka Garg is a document available to read on EtoBox.

This document discusses graph coloring problems and their applications in scheduling. It reviews variants of graph coloring like precoloring extension, list coloring, and multicoloring. It provides examples of how scheduling problems can be modeled as graph coloring problems, including aircraft scheduling which results in an interval graph that can be colored optimally in polynomial time, and biprocessor task scheduling which can be modeled as edge coloring. It also discusses approximation algorithms for pr

Author

Anushka Garg

Language

EN