2018/04/21 by Glencora Borradaile, Hung Le, Borradaile, Glencora +3
Computer Science · #Advanced Graph Theory Research #Complexity and Algorithms in Graphs #Data Structures and Algorithms (cs.DS) #FOS: Computer and information sciences #Interconnection Networks and Systems
paper · pdf · doi:10.48550/arxiv.1804.07869
openalex publication_date 2018/04/21 · openalex created_date 2018/05/07 · openalex updated_date 2026/07/28
We present two algorithms for the minimum feedback vertex set problem in planar graphs: an O(n log n) PTAS using a linear kernel and balanced separator, and a heuristic algorithm using kernelization and local search. We implemented these algorithms and compared their performance with Becker and Geiger's 2-approximation algorithm. We observe that while our PTAS is competitive with the 2-approximation algorithm on large planar graphs, its running time is much longer. And our heuristic algorithm can outperform the 2-approximation algorithm on most large planar graphs and provide a trade-off between running time and solution quality, i.e. a "PTAS behavior".