logo
  • Articles
  • Editors
  • Submit
  • Search
  • Home
  • About
  • Articles
  • Special Issues
  • Graduate Surveys
  • Library
  • Editors
  • Submit
  • Issues
  • Contact Us
  • Search
Articles under category:
Acyclic Subgraph
Vol 11, Article 10 (pp 257-283) [APRX-RND13 Spec Issue]
On the NP-Hardness of Approximating Ordering-Constraint Satisfaction Problems
by Per Austrin, Rajsekar Manokaran, and Cenny Wenner