A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound

Svatopluk Poljak, Daniel TurzĂ­k. A polynomial time heuristic for certain subgraph optimization problems with guaranteed worst case bound. Discrete Mathematics, 58(1):99-104, 1986. [doi]

Abstract

Abstract is missing.