A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem

DOI10.1137/1.9781611972900.3zbMath1430.68446OpenAlexW2218932272MaRDI QIDQ5233591

Stefan Canzar, Julián Mestre, Khaled M. Elbassioni

Publication date: 11 September 2019

Published in: 2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/0266b83bb685cb056c6451692fc077c34f99c1f8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Integer programming (90C10) Linear programming (90C05) Biochemistry, molecular biology (92C40) Coloring of graphs and hypergraphs (05C15) Approximation algorithms (68W25)

Related Items (1)

Deconstructing intractability-A multivariate complexity analysis of interval constrained coloring

This page was built for publication: A Polynomial Delay Algorithm for Enumerating Approximate Solutions to the Interval Constrained Coloring Problem