The undirected feedback vertex set problem with application to wavelength converter placement on WDM networks

Abstract

This paper considers a size constrained version of the undirected feedback vertex set problem motivated by placing wavelength converters on a WDM network efficiently, and proves that this problem is NP-complete even in several special cases. Moreover, the paper presents a simple approximation algorithm for a minimization version of the problem using an algorithm for the original minimum undirected feedback vertex set problem.