The Linearity of First-Fit Coloring of Interval Graphs
暂无分享,去创建一个
It is shown that First-Fit coloring requires at most $40\omega $ colors to color an interval graph with clique size $\omega $. It follows that a polynomial time approximation algorithm for Dynamic Storage Allocation due to Chrobak and Slusarek has a constant performance ratio of 80.