|
Article 11
(pages 211-219)
The Randomized Communication Complexity of Set Disjointness by Johan Håstad, Avi Wigderson |
|
Article 10
(pages 197-209)
An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem by Chandra Chekuri, Martin Pál |
|
Article 9
(pages 179-195)
Approximation Algorithms and Online Mechanisms for Item Pricing by Maria-Florina Balcan, Avrim Blum |