Complexity and online algorithms for minimum skyline coloring of intervals
DOI10.1007/978-3-319-71147-8_22zbMath1425.68462OpenAlexW2770561088MaRDI QIDQ5915896
Shmuel Zaks, Hsiang-Hsuan Liu, Mordechai Shalom, Erlebach, Thomas, Prudence W. H. Wong, Fu-Hong Liu
Publication date: 26 March 2018
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2381/42225
Programming involving graphs or networks (90C35) Combinatorics in computer science (68R05) Coloring of graphs and hypergraphs (05C15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27)
This page was built for publication: Complexity and online algorithms for minimum skyline coloring of intervals
