An Approximation Algorithm for Diagnostic Test Scheduling in Multicomputer Systems
IEEE Transactions on Computers
The complexity of scheduling independent two-processor tasks on dedicated processors
Information Processing Letters
An approximation algorithm for scheduling on three dedicated machines
Discrete Applied Mathematics
An approximation result for a duo-processor task scheduling problem
Information Processing Letters
Efficiency and effectiveness of normal schedules on three dedicated processors
Selected papers from the second Krakow conference on Graph theory
Comparability graph augmentation for some multiprocessor scheduling problems
Discrete Applied Mathematics - Special issue on models and algorithms for planning and scheduling problems
Algorithms for compile-time memory optimization
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
An approximation result for a periodic allocation problem
Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Bandwidth Allocation in ATM Networks
IEEE Communications Magazine
Approximating interval coloring and max-coloring in chordal graphs
Journal of Experimental Algorithmics (JEA)
Scratchpad allocation for data aggregates in superperfect graphs
Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Scratchpad memory allocation for data aggregates via interval coloring in superperfect graphs
ACM Transactions on Embedded Computing Systems (TECS)
| Hi-index | 0.00 |
We study the problem of finding an acyclic orientation of an undirected graph, such that each (oriented) path is covered by a limited number k of maximal cliques. This is equivalent to finding a k-approximate solution for the interval coloring problem on a graph. We focus our attention on claw-free chordal graphs, and show how to find an orientation of such a graph in linear time, which guarantees that each path is covered by at most two maximal cliques. This extends previous published results on other graph classes where stronger assumptions were made.