Generalization of Hitting, Covering and Packing Problems on Intervals
Interval graphs are well studied structures. Intervals can represent resources like jobs to be sched-uled. Finding maximum independent set in interval graphs would correspond to scheduling maximum number of non-conflicting jobs on the computer. Most optimization problems on interval graphs like inde...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2018
|
| Subjects: | |
| Online Access: | http://etd.iisc.ernet.in/2005/3628 http://etd.iisc.ernet.in/abstracts/4498/G28474-Abs.pdf |