Weighted sum coloring in batch scheduling of conflicting jobs
From MaRDI portal
Publication:1031871
DOI10.1007/s00453-007-9161-zzbMath1183.68106OpenAlexW2172372952MaRDI QIDQ1031871
Hadas Shachnai, Leah Epstein, Magnús M. Halldórsson, Asaf Levin
Publication date: 23 October 2009
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00453-007-9161-z
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Related Items (4)
Graph multi-coloring for a job scheduling application ⋮ Improved bounds for randomized preemptive online matching ⋮ Min-sum bin packing ⋮ A note on selective line-graphs and partition colorings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The maximum k-colorable subgraph problem for chordal graphs
- On chain and antichain families of a partially ordered set
- Approximation algorithms for combinatorial problems
- On the ratio of optimal integral and fractional covers
- On the sum coloring problem on interval graphs
- On chromatic sums and distributed resource allocation
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
- Approximating min sum set cover
- On the Size of Systems of Sets Every t of which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems
- A Greedy Heuristic for the Set-Covering Problem
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
- Sum Multicoloring of Graphs
- Database Theory - ICDT 2005
- Paths, Trees, and Flowers
- Approximation and Online Algorithms
This page was built for publication: Weighted sum coloring in batch scheduling of conflicting jobs
