On the minimum load coloring problem

DOI10.1016/J.JDA.2006.09.001zbMath1136.05017OpenAlexW2115644504MaRDI QIDQ2466019

Benjamin Doerr, Andreas Baltz, Anand Srivastav, Nitin Ahuja, Aleš Přívétivý

Publication date: 11 January 2008

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2006.09.001

zbMATH Keywords

Graph partitioningGraph coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

On structural parameterizations of load coloring ⋮ Dealing with several parameterized problems by random methods ⋮ Reinforcement learning based tabu search for the minimum load coloring problem ⋮ Parameterized and approximation algorithms for the load coloring problem ⋮ A general variable neighborhood search approach for the minimum load coloring problem ⋮ Parameterized algorithms for load coloring problem ⋮ Improved Algorithms for Several Parameterized Problems Based on Random Methods ⋮ On structural parameterizations of load coloring

Cites Work

• Some simplified NP-complete graph problems
• The graph genus problem is NP-complete
• A Separator Theorem for Planar Graphs
• Approximation and Online Algorithms
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the minimum load coloring problem