# Tight Localizations of Feedback Sets

@article{Hecht2020TightLO, title={Tight Localizations of Feedback Sets}, author={M. Hecht and Krzysztof Gonciarz and S. Horv'at}, journal={ArXiv}, year={2020}, volume={abs/2001.01440} }

The classical NP-hard \emph{feedback arc set problem} (FASP) and \emph{feedback vertex set problem} (FVSP) ask for a minimum set of arcs $\varepsilon \subseteq E$ or vertices $\nu \subseteq V$ whose removal $G\setminus \varepsilon$, $G\setminus \nu$ makes a given multi-digraph $G=(V,E)$ acyclic, respectively. The corresponding decision problems are part of the $21$ NP-complete problems of R. M. Karp's famous list. Though both problems are known to be APX-hard, approximation algorithms or proofs… CONTINUE READING

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 45 REFERENCES

Exact localisations of feedback

- 2018

A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem

- Mathematics, Computer Science
- 1999

294