Efficient heuristics to compute minimal and stable feedback arc sets
From MaRDI portal
Publication:6646752
DOI10.1007/S10878-024-01209-8MaRDI QIDQ6646752FDOQ6646752
Authors: Claudia Cavallaro, Vincenzo Cutello, Mario Pavone 
Publication date: 3 December 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
heuristicsexperimental analysisoptimization problemminimal feedback arc setlinear arrangement of vertices
Cites Work
- Reducibility among combinatorial problems
- On the hardness of approximating minimum vertex cover
- A Minimax Theorem for Directed Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- A fast and effective heuristic for the feedback arc set problem
- Dense and sparse graph partition
- Exact localisations of feedback sets
- An exact method for the minimum feedback arc set problem
- Tight localizations of feedback sets
- Feedback arc set. A history of the problem and algorithms
This page was built for publication: Efficient heuristics to compute minimal and stable feedback arc sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6646752)
