> Details

Bathie, Gabriel [Author]; Berthe, Gaétan [Author]; Coudert-Osmont, Yoann [Author]; Desobry, David [Author]; Reinald, Amadeus [Author]; Rocton, Mathis [Author] ; Gabriel Bathie and Gaétan Berthe and Yoann Coudert-Osmont and David Desobry and Amadeus Reinald and Mathis Rocton [Contributor]

PACE Solver Description: DreyFVS

Reference
management

Bookmarks

Remove from
bookmarks

Share this on Whatsapp

Close

Bookmarks



You can manage bookmarks using lists, please log in to your user account for this.
  • Media type: E-Article; Electronic Conference Proceeding; Text
  • Title: PACE Solver Description: DreyFVS
  • Contributor: Bathie, Gabriel [Author]; Berthe, Gaétan [Author]; Coudert-Osmont, Yoann [Author]; Desobry, David [Author]; Reinald, Amadeus [Author]; Rocton, Mathis [Author]
  • imprint: Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2022
  • Language: English
  • DOI: https://doi.org/10.4230/LIPIcs.IPEC.2022.31
  • Keywords: Heuristic ; Local search ; Sinkhorn algorithm ; Directed Feedback Vertex Set
  • Origination:
  • Footnote: Diese Datenquelle enthält auch Bestandsnachweise, die nicht zu einem Volltext führen.
  • Description: We describe DreyFVS, a heuristic for Directed Feedback Vertex Set submitted to the 2022 edition of Parameterized Algorithms and Computational Experiments Challenge. The Directed Feedback Vertex Set problem asks to remove a minimal number of vertices from a digraph such that the resulting digraph is acyclic. Our algorithm first performs a guess on a reduced instance by leveraging the Sinkhorn-Knopp algorithm, to then improve this solution by pipelining two local search methods.
  • Access State: Open Access