"On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems."

Per Austrin, Rajsekar Manokaran, Cenny Wenner (2013)

Details and statistics

DOI:

access: open

type: Informal or Other Publication

metadata version: 2018-08-13

a service of  Schloss Dagstuhl - Leibniz Center for Informatics