Parameterized algorithms for load coloring problem

DOI10.1016/j.ipl.2014.03.008zbMath1296.05186arXiv1308.1820OpenAlexW2963069805MaRDI QIDQ2448120

Yanyan Li

Publication date: 30 April 2014

Published in: Information Processing Letters (Search for Journal in Brave)

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

zbMATH Keywords

design of algorithmskernelfixed-parameter tractableload coloring

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

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 ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable ⋮ Improved Algorithms for Several Parameterized Problems Based on Random Methods ⋮ On structural parameterizations of load coloring ⋮ Balanced Judicious Bipartition is Fixed-Parameter Tractable

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On problems without polynomial kernels
• Treewidth. Computations and approximations
• On the minimum load coloring problem
• Parametrized complexity theory.
• Kernel Bounds for Disjoint Cycles and Disjoint Paths

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