Purchase this Article:
Near-optimal algorithms for maximum constraint satisfaction problems

Moses Charikar, Konstantin Makarychev, Yury Makarychev

Step 1

Sign in or create a free Web account
Sign in with your Web account



-or-
Create a free Web account

Step 2

Pricing and access depends on your membership or subscriptions with ACM.
Near-optimal algorithms for maximum constraint satisfaction problems
ACM Member$10.00
ACM Student Member$5.00
Non Member$15.00

Join ACM and subscribe to the ACM Digital Library to gain access to all materials
Professional Membership
with an ACM Digital Library subscription
$198.00
Student Membership
with an ACM Digital Library subscription
$42.00

Subscribe to access this Article and all materials from this publication
Print & Online TALG Online Access Only $408.00

Buy the publication that this Article appeared in
Transactions on Algorithms Volume: 5 Issue: 03
Cover Image
ACM Member$18.00
Non Member$40.00
Please sign in, (step 1), to place your order
Research. Rent. Read.
Rent this article Available for rent through DeepDyve

Read this article

View-only access for 24 hours

$2.99

DeepDyve is the largest online rental service for scientific, technical and medical research.


The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2019 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us