A Fast and Effective Algorithm for the Feedback Arc Set Problem

Authors:
Youssef Saab
Affiliations:
Computer Engineering and Computer Science Department, 321 Engineering Building West, University of Missouri-Columbia, Columbia, MO 65211, USA. saab@cecs.missouri.edu
Venue:
Journal of Heuristics
Year:
2001

Citing 9
Cited 1

A new approach to the maximum flow problem

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Finding a minimum feedback arc set in reducible flow graphs

Journal of Algorithms
Introduction to algorithms

Introduction to algorithms
A fast and effective heuristic for the feedback arc set problem

Information Processing Letters
Approximation alogorithms for the maximum acyclic subgraph problem

SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Estimating the Complexity of Synthesized Designs from FSM Specifications

IEEE Design & Test
A Fast and Robust Network Bisection Algorithm

IEEE Transactions on Computers
Combinatorial optimization by stochastic evolution with applications to the physical design of vlsi circuits

Combinatorial optimization by stochastic evolution with applications to the physical design of vlsi circuits

Ranking tournaments: Local search and a new algorithm

Journal of Experimental Algorithmics (JEA)

Quantified Score

Hi-index	0.00

Visualization

Abstract

A divide-and-conquer approach for the feedback arc set is presented. The divide step is performed by solving a minimum bisection problem. Two strategies are used to solve minimum bisection problem: A heuristic based on the stochastic evolution methodology, and a heuristic based on dynamic clustering. Empirical results are presented to compare our method with other approaches. An algorithm to construct test cases for the feedback arc set problem with known optimal number of feedback arcs, is also presented.