Timothy Law Snyder

According to our database, Timothy Law Snyder authored at least 12 papers between 1989 and 1995.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

1995

Equidistribution in All Dimensions of Worst-Case Point Sets for the Traveling Salesman Problem.

Timothy Law Snyder, J. Michael Steele

SIAM J. Discret. Math., 1995

A Priori Bounds on the Euclidean Traveling Salesman.

Timothy Law Snyder, J. Michael Steele

SIAM J. Comput., 1995

1994

Worst-Case TSP Point Sets in All Dimensions are Asymptotically Equidistributed.

Timothy Law Snyder, J. Michael Steele

Proceedings of the 6th Canadian Conference on Computational Geometry, 1994

1993

Equidistribution of Point Sets for the Traveling Salesman and Related Problems.

Timothy Law Snyder, J. Michael Steele

Proceedings of the Fourth Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1993

1992

On the Exact Location of Steiner Points in General Dimension.

Timothy Law Snyder

SIAM J. Comput., 1992

Worst-Case Minimum Rectilinear Steiner Trees in All Dimensions.

Timothy Law Snyder

Discret. Comput. Geom., 1992

<i>A Priori</i> Inequalities for the Euclidean Traveling Salesman.

Timothy Law Snyder, J. Michael Steele

Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991

Corrigendum: Lower Bounds for Rectilinear Steiner Trees.

Timothy Law Snyder

Inf. Process. Lett., 1991

Lower Bounds for Rectilinear Steiner Trees in Bounded Space.

Timothy Law Snyder

Inf. Process. Lett., 1991

1990

Worst-case greedy matchings in the unit <i>d</i>-cube.

Timothy Law Snyder, J. Michael Steele

Networks, 1990

On Minimal Rectilinear Steiner Trees in All Dimensions.

Timothy Law Snyder

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

Worst-Case Growth Rates of Some Classical Problems of Combinatorial Optimization.

J. Michael Steele, Timothy Law Snyder

SIAM J. Comput., 1989