Minimizing average completion of dedicated tasks and interval graphs

DOI10.1007/3-540-44666-4_15MaRDI QIDQ4780787zbMATH OpenFDO

Authors Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai

Publication date 21 November 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2129/21290114

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Sum Multicoloring of Graphs
• A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
• Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
• Approximation and Online Algorithms
• Preemptive scheduling with dedicated processors: applications of fractional graph coloring

Cited in

(11)

• Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
• Minimum sum coloring problem: upper bounds for the chromatic strength
• A dichotomy for minimum cost graph homomorphisms
• Minimum Cost Homomorphism Dichotomy for Oriented Cycles
• Sum Multicoloring of Graphs
• scientific article; zbMATH DE number 7561584 (Why is no real title available?)
• Minimum Cost Homomorphisms to Reflexive Digraphs
• Approximation and Online Algorithms
• Complexity and online algorithms for minimum skyline coloring of intervals
• Minimum cost homomorphism dichotomy for oriented cycles
• The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops

This page was built for publication: Minimizing average completion of dedicated tasks and interval graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4780787)