1 citations · 1 across the 2 of their papers we have counts for
1 paper · 1 filter
Per Austrin, Rajsekar Manokaran, Cenny Wenner
We show improved NP-hardness of approximating Ordering Constraint Satisfaction Problems (OCSPs). For the two most well-studied OCSPs, Maximum Acyclic Subgraph and Maximum Betweenne…