A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On the Approximability of Digraph Ordering

2016
*
Algorithmica
*

Given an n-vertex digraph D = (V, A) the Max-k-Ordering problem is to compute a labeling : V → [k] maximizing the number of forward edges, i.e. edges (u, v) such that (u) < (v). For different values of k, this reduces to maximum acyclic subgraph (k = n), and Max-DiCut (k = 2). This work studies the approximability of Max-k-Ordering and its generalizations, motivated by their applications to job scheduling with soft precedence constraints. We give an LP rounding based 2approximation algorithm

doi:10.1007/s00453-016-0227-7
fatcat:mfpulgouibaglawrnun4cjgeru