A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem

DOI10.1145/2444016.2493372zbMath1322.68262OpenAlexW2093879302MaRDI QIDQ5178741

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

Publication date: 16 March 2015

Published in: ACM Journal of Experimental Algorithmics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2444016.2493372

zbMATH Keywords

protein structureLP roundinghydrogen-deuterium exchange

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 (2)

On the approximability of the maximum interval constrained coloring problem ⋮ The interval constrained 3-coloring problem

This page was built for publication: A polynomial-delay algorithm for enumerating approximate solutions to the interval constrained coloring problem