Parameterized and approximation algorithms for the load coloring problem

DOI10.1007/s00453-016-0259-zzbMath1372.68117arXiv1412.3023OpenAlexW2964301921WikidataQ59613524 ScholiaQ59613524MaRDI QIDQ2408202

Yanyan Li

Publication date: 10 October 2017

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.3023

zbMATH Keywords

kernelsapproximation algorithmsparameterized algorithmsFPTload coloring

Mathematics Subject Classification ID

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

Related Items (max. 100)

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 ⋮ A general variable neighborhood search approach for the minimum load coloring problem ⋮ On structural parameterizations of load coloring ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable

Uses Software

• OEIS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fundamentals of parameterized complexity
• Fixed-parameter complexity of minimum profile problems
• The ring of \(k\)-regular sequences. II.
• Parameterized algorithms for load coloring problem
• The linear arrangement problem parameterized above guaranteed value
• On the minimum load coloring problem
• Kernelization – Preprocessing with a Guarantee
• Subexponential parameterized algorithms on bounded-genus graphs and H -minor-free graphs
• (Meta) Kernelization
• A Bound on the Pathwidth of Sparse Graphs with Applications to Exact Algorithms
• Parameterized Algorithms

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