A 1/2-approximation algorithm for the Maximum Acyclic Subgraph problem under Negative Disjunctive Constraints


A directed graph may contain directed cycles which may be undesirable or not allowed at all in some practical applications. Therefore, in order to withdraw as few arcs as possible, a maximum directed acyclic graph should be found. The problem of finding the Maximum Acyclic Subgraph (MAS) of a given directed graph G = (V,A) consists in determining a maximum… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics