Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- Haim Kaplan
- Moshe Lewenstein
- et al.
- 2005
- Journal of the ACM
Publications
Date
Featured collections
Popular topics
195 results at Journal of the ACM
The random oracle methodology, revisited
- Ran Canetti
- Oded Goldreich
- et al.
- 2004
- Journal of the ACM
Magic functions
- Cynthia Dwork
- Moni Naor
- et al.
- 2003
- Journal of the ACM
Mini-buckets: A general scheme for bounded inference
- Rina Dechter
- Irina Rish
- 2003
- Journal of the ACM
Cosmological lower bound on the circuit complexity of a small problem in logic
- Larry Stockmeyer
- Albert R. Meyer
- 2002
- Journal of the ACM
Towards a theory of cache-efficient algorithms
- Sandeep Sen
- Siddhartha Chatterjee
- et al.
- 2002
- Journal of the ACM
Compactly encoding unstructured inputs with differential compression
- Miklos Ajtai
- Randal Burns
- et al.
- 2002
- Journal of the ACM
A unified approach to approximating resource allocation and scheduling
- Amotz Bar-Noy
- Reuven Bar-Yehuda
- et al.
- 2001
- Journal of the ACM
Adversarial queuing theory
- Allan Borodin
- Jon Kleinberg
- et al.
- 2001
- Journal of the ACM
Divide-and-conquer approximation algorithms via spreading metrics
- Guy Even
- Joseph Naor
- et al.
- 2000
- Journal of the ACM