Data structures for traveling salesmen

Authors:
M. L. Fredman;D. S. Johnson;L. A. Mc Geoch;G. Ostheimer
Affiliations:
Rutgers University, New Brunswick, NJ 08093 and University of California at San Diego, La Jolla, CA;Room 2D-150, AT&T Bell Laboratories, Murray Hill, NJ;Department of Mathematics and Computer Science, Amherst College, Amherst, MA;Department of Mathematics, Rutgers University, New Brunswick, NJ
Venue:
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Year:
1993

Self-adjusting binary search trees

Journal of the ACM (JACM)
The cell probe complexity of dynamic data structures

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Local optimization and the traveling salesman problem

Proceedings of the seventeenth international colloquium on Automata, languages and programming
BLASTING through the information theoretic barrier with FUSION TREES

STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing

Computational experience with an approximation algorithm on large-scale Euclidean matching instances

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Finding the optimal gene order in displaying microarray data

GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII

Hi-index	0.00