scientific article; zbMATH DE number 1833406

zbMath0998.68508MaRDI QIDQ4780787

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: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (8)

Minimum cost homomorphism dichotomy for oriented cycles ⋮ Minimum sum coloring problem: upper bounds for the chromatic strength ⋮ A dichotomy for minimum cost graph homomorphisms ⋮ Minimum Cost Homomorphism Dichotomy for Oriented Cycles ⋮ The complexity of the minimum cost homomorphism problem for semicomplete digraphs with possible loops ⋮ Unnamed Item ⋮ Complexity and online algorithms for minimum skyline coloring of intervals ⋮ Minimum Cost Homomorphisms to Reflexive Digraphs

This page was built for publication: