1.5-Approximation Algorithm for the 2-Convex Recoloring Problem

DOI10.1007/978-3-319-29516-9_25zbMath1474.68209OpenAlexW2412194315MaRDI QIDQ2798241

Gilad Kutiel, Dror Rawitz, Reuven Bar Yehuda

Publication date: 4 April 2016

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-29516-9_25

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25)

Related Items (1)

Strong intractability of generalized convex recoloring problems

This page was built for publication: 1.5-Approximation Algorithm for the 2-Convex Recoloring Problem