Parameterized and approximation algorithms for the load coloring problem

DOI10.4230/LIPICS.IPEC.2015.43MaRDI QIDQ5363758zbMATH OpenFDO

Authors

Publication date 29 September 2017

zbMATH Keywords

fixed-parameter tractabilitykernelizationload coloring

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Parameterized and approximation algorithms for the load coloring problem
• Parameterized algorithms for load coloring problem
• On the minimum load coloring problem
• Approximation and Online Algorithms
• Coloring Graphs with Minimal Edge Load

Cited in

(7)

• Balanced judicious bipartition is fixed-parameter tractable
• Load balancing by graph coloring, an algorithm
• On structural parameterizations of load coloring
• Parameterized and approximation algorithms for the load coloring problem
• Parameterized algorithms for load coloring problem
• On the minimum load coloring problem
• Approximation and Online Algorithms

This page was built for publication: Parameterized and approximation algorithms for the load coloring problem

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