Local Search is a PTAS for Feedback Vertex Set in Minor-free Graphs

04/17/2018
by   Hung Le, et al.
0

Given an undirected graph, the Feedback Vertex Set (FVS) problem asks for a minimum set of vertices that hits all the cycles of the graph. Fomin, Lokshtanov, Rauman and Saurabh gave a PTAS for the FVS problem in H-minor-free graphs. Their algorithm relies on many complicated algorithmic tools. In this work, we show that a simple local search algorithm, that tries to improve the solution by exchanging only constant number of vertices, is a PTAS for the FVS problem in H-minor-free graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/01/2014

Solving the undirected feedback vertex set problem by local search

An undirected graph consists of a set of vertices and a set of undirecte...
research
04/04/2023

VC Set Systems in Minor-free (Di)Graphs and Applications

A recent line of work on VC set systems in minor-free (undirected) graph...
research
02/19/2018

An Efficient Local Search for the Minimum Independent Dominating Set Problem

In the present paper, we propose an efficient local search for the minim...
research
04/24/2019

A multi-start local search algorithm for the Hamiltonian completion problem on undirected graphs

This paper proposes a local search algorithm for a specific combinatoria...
research
12/10/2019

Graph Pricing with Limited Supply

We study approximation algorithms for graph pricing with vertex capaciti...
research
08/23/2023

RamseyRL: A Framework for Intelligent Ramsey Number Counterexample Searching

The Ramsey number is the minimum number of nodes, n = R(s, t), such that...
research
09/17/2014

A Tabu Search Algorithm for the Multi-period Inspector Scheduling Problem

This paper introduces a multi-period inspector scheduling problem (MPISP...

Please sign up or login with your details

Forgot password? Click here to reset