scientific article; zbMATH DE number 1833406

zbMATH Open0998.68508MaRDI QIDQ4780787FDOQ4780787

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

Publication date: 21 November 2002

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

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

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

Cited In (11)

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

This page was built for publication:

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