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

.

##
###
On the Approximability of Digraph Ordering
[article]

2015
*
arXiv
*
pre-print

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 2-approximation algorithm

arXiv:1507.00662v1
fatcat:izonkxu2x5dijicqixmku4g7mi