Weighted sum coloring in batch scheduling of conflicting jobs
From MaRDI portal
Publication:1031871
DOI10.1007/S00453-007-9161-ZzbMATH Open1183.68106OpenAlexW2172372952MaRDI QIDQ1031871FDOQ1031871
Authors: Leah Epstein, Magnús M. Halldórsson, Asaf Levin, Hadas Shachnai 
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
Recommendations
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25)
Cites Work
- Title not available (Why is that?)
- Approximation algorithms for combinatorial problems
- A Greedy Heuristic for the Set-Covering Problem
- Paths, Trees, and Flowers
- On the ratio of optimal integral and fractional covers
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Title not available (Why is that?)
- 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)?
- The maximum k-colorable subgraph problem for chordal graphs
- On chromatic sums and distributed resource allocation
- Title not available (Why is that?)
- 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
- On chain and antichain families of a partially ordered set
- Title not available (Why is that?)
- Approximating min sum set cover
- Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
- An asymptotic approximation scheme for multigraph edge coloring
- Database Theory - ICDT 2005
- On the sum coloring problem on interval graphs
- Sum Multicoloring of Graphs
- Title not available (Why is that?)
- Approximation and Online Algorithms
Cited In (7)
- Graph coloring approaches for a production planning problem with makespan and setup penalties in a product-wheel context
- Batch Coloring Flat Graphs and Thin
- Improved bounds for randomized preemptive online matching
- Graph multi-coloring for a job scheduling application
- Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
- A note on selective line-graphs and partition colorings
- Min-sum bin packing
This page was built for publication: Weighted sum coloring in batch scheduling of conflicting jobs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1031871)
