Approximating the minimum clique cover and other hard problems in subtree filament graphs

J. Mark Keil, Lorna Stewart. Approximating the minimum clique cover and other hard problems in subtree filament graphs. Discrete Applied Mathematics, 154(14):1983-1995, 2006. [doi]

Abstract

Abstract is missing.