Corpus ID: 209862369

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}
}
  • M. Hecht, Krzysztof Gonciarz, S. Horv'at
  • Published 2020
  • Computer Science, Mathematics
  • ArXiv
  • 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
    Reducibility Among Combinatorial Problems
    4327
    Exact localisations of feedback
    • 2018
    A Fast and Effective Algorithm for the Feedback Arc Set Problem
    • Y. Saab
    • Computer Science, Mathematics
    • 2001
    23
    A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
    294
    A Minimax Theorem for Directed Graphs
    135
    A faster deterministic maximum flow algorithm
    164
    A fixed-parameter algorithm for the directed feedback vertex set problem
    108
    A heuristic for the feedback arc set problem
    31
    A new approach to the maximum flow problem
    1446
    A study of asynchronous logical feedback networks
    7