Any fast algorithm for minimum cost feedback arc set problem? Posted by miao, at cstheory.stackexchange.com, 23 Aug 2010 In a directed graph, $G=(V,E)$, $F\subset E$, if $G\setminus F$ is a DAG(directed acyclic graph), $F$ is called a feedback arc…