Weighted sum coloring in batch scheduling of conflicting jobs
type: Item
instance of: scholarly article
title: Weighted sum coloring in batch scheduling of conflicting jobs
zbMATH Open document ID: 1183.68106
author: Leah Epstein
author: Magnús M. Halldórsson
author: Asaf Levin
author: Hadas Shachnai
published in: Algorithmica
publication date: 2009-10-23T00:00:00Z
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5620133
zbMATH Keywords: approximation algorithms
zbMATH Keywords: batch scheduling
zbMATH Keywords: geometric partitioning
MaRDI profile type: Publication
full work available at URL: s00453-007-9161-z
OpenAlex ID: W2172372952
cites work: On chromatic sums and distributed resource allocation
cites work: Sum Multicoloring of Graphs
cites work: Q4826104
cites work: A Greedy Heuristic for the Set-Covering Problem
cites work: Q4250178
cites work: Paths, Trees, and Flowers
cites work: Approximating min sum set cover
cites work: On chain and antichain families of a partially ordered set
cites work: Approximation and Online Algorithms
cites work: Q4198056
cites work: Q3216686
cites work: Sum coloring interval and \(k\)-claw free graphs with application to scheduling dependent jobs
cites work: 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
cites work: Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
cites work: Approximation algorithms for combinatorial problems
cites work: On the ratio of optimal integral and fractional covers
cites work: Database Theory - ICDT 2005
cites work: On the sum coloring problem on interval graphs
cites work: An asymptotic approximation scheme for multigraph edge coloring
cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes)
cites work: Q4715388
cites work: When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?
cites work: The maximum k-colorable subgraph problem for chordal graphs
DOI: 10.1007/S00453-007-9161-Z
description: scientific article; zbMATH DE number 5620133