Batch Coloring Flat Graphs and Thin

DOI10.1007/978-3-540-69903-3_19MaRDI QIDQ3512459zbMATH OpenOpenAlexFDO

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

Publication date 15 July 2008

Published in Algorithm Theory – SWAT 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-69903-3_19

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Deterministic scheduling theory in operations research (90B35)

Recommendations

• Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
• Weighted sum coloring in batch scheduling of conflicting jobs
• Batch coloring of graphs
• Batch Coloring of Graphs
• A hypocoloring model for batch scheduling

Cites work

• A coloring problem for weighted graphs
• Approximation algorithms for NP-complete problems on planar graphs
• Approximation and Online Algorithms
• Automata, Languages and Programming
• Batch Coloring Flat Graphs and Thin
• scientific article; zbMATH DE number 1306887 (Why is no real title available?)
• scientific article; zbMATH DE number 944424 (Why is no real title available?)
• scientific article; zbMATH DE number 2114378 (Why is no real title available?)
• On chromatic sums and distributed resource allocation
• On the efficiency of polynomial time approximation schemes
• On the Max Coloring Problem
• Sum Multicoloring of Graphs
• Tools for Multicoloring with Applications to Planar Graphs and Partial k-Trees
• Weighted coloring: further complexity and approximability results
• Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs

Cited in

(14)

• Weighted sum coloring in batch scheduling of conflicting jobs
• Batch coloring of graphs
• Bounded max-colorings of graphs
• Exact Algorithms for Weighted Coloring in Special Classes of Tree and Cactus Graphs
• Batch Coloring of Graphs
• Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
• Batch Coloring Flat Graphs and Thin
• Weighted Sum Coloring in Batch Scheduling of Conflicting Jobs
• Max-coloring paths: tight bounds and extensions
• Structural and extremal properties of the hot rolling batches precedence graph
• A memetic algorithm with adaptive operator selection for graph coloring
• On the max coloring problem
• Clique clustering yields a PTAS for max-coloring interval graphs
• Approximating the max-edge-coloring problem

This page was built for publication: Batch Coloring Flat Graphs and Thin

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