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

Per Austrin, Rajsekar Manokaran, Cenny Wenner (2013)

> Home

Details and statistics

DOI: 10.1007/978-3-642-40328-6_3

access: closed

type: Conference or Workshop Paper

metadata version: 2017-05-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/approx/AustrinMW13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/approx/AustrinMW13
Per Austrin, Rajsekar Manokaran, Cenny Wenner:
On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems. APPROX-RANDOM 2013: 26-41

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.