Packing cycles in planar and bounded-genus graphs

Niklas Schlomberg, Hanjo Thiele, Jens Vygen

We devise constant-factor approximation algorithms for finding as many disjoint cycles as possible from a certain family of cycles in a given planar or bounded-genus graph. Here di…