We present a O(|A|(|V | + |A|)) heuristic Algorithm for the minimum weighted feedback arc set problem. The Algorithm is based on two linear arrangements of the set of arcs, and on the concept of minimal and stable feedback arc set previously introduced and now generalized to the weighted case. The obtained results, compared to two other state of the art Algorithms, show a high level of efficacy of the proposed Algorithm.
An efficient heuristic algorithm to compute minimal and stable weighted feedback arc sets
Cavallaro C.;Cutello V.
2025-01-01
Abstract
We present a O(|A|(|V | + |A|)) heuristic Algorithm for the minimum weighted feedback arc set problem. The Algorithm is based on two linear arrangements of the set of arcs, and on the concept of minimal and stable feedback arc set previously introduced and now generalized to the weighted case. The obtained results, compared to two other state of the art Algorithms, show a high level of efficacy of the proposed Algorithm.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
