To Appear In Siam Journal On Computing Esther M. Arkin, Yi-Jen Chiang,...  Home/Search
Context
Related
| poly.edu/chiang/TSPSICOMP.ps.gz sunysb.edu/~skiena/papers/scatter.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: poly.edu/chiang/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the problem of computing a Hamiltonian tour (cycle) or path on a set of points in order to maximize the minimum edge length in the tour or path. This "maximum scatter" TSP is closely related to the bottleneck TSP, and is motivated by applications in manufacturing (e.g., sequencing of rivet operations) and medical imaging. In this paper, we give the first algorithmic study of these problems, including complexity results, approximation algorithms, and exact algorithms for special cases.... (Update)
Similar documents (at the sentence level):
54.2%: On the Maximum Scatter TSP - Arkin, Chiang, Mitchell, Skiena, Yang (1996) (Correct)
24.7%: On the Maximum Scatter TSP (Extended Abstract) - Arkin, Chiang, Mitchell.. (1997) (Correct)
Active bibliography (related documents): More All
1.4: DOI: 10.1007/s00453-004-1124-z - Algorithmica Of Of (Correct)
0.7: Geometric Shortest Paths and Network Optimization - Mitchell (1998) (Correct)
0.5: Optimal and Pessimal Orderings of Steiner Triple Systems in.. - Cohen, Colbourn (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ in-maximum,
author = "To Appear In",
title = "On The Maximum Scatter Tsp",
url = "citeseer.ist.psu.edu/765143.html" }
Citations (may not include all citations):185 algorithm for maximum matchings in bipartite graphs (context) - Hopcroft, Karp - 1973
106 The traveling salesman problem: A guided tour of combinatori.. (context) - Lawler, Lenstra et al. - 1985
58 Network flow and testing graph connectivity (context) - Even, Tarjan - 1975
50 The algorithmic aspects of the regularity lemma - Alon, Duke et al. - 1992
48 Some theorems on abstract graphs (context) - Dirac - 1952
40 On representatives of subsets (context) - Hall - 1935
29 Long tours and short superstrings (context) - Kosaraju, Park et al. - 1994
25 Two algorithmic results for the traveling salesman problem - Barvinok - 1996
12 The maximum traveling salesman problem under polyhedral norm.. - Barvinok, Johnson et al. - 1998
11 Guaranteed performance heuristics for the bottleneck traveli.. (context) - Parker, Rardin - 1984
11 Simplicity and hardness of the maximum traveling salesman pr.. - Fekete - 1998
7 Long non-crossing configurations in the plane (context) - Alon, Rajagopalan et al. - 1993
7 the maximum scatter TSP - Arkin, Chiang et al. - 1997
6 An approximation algorithm for the maximum traveling salesma.. - Hassin, Rubinstein - 1997
5 Coordination hole tolerance stacking (context) - Scholz - 1993
5 Personal communication (context) - Khuller - 1996
4 Tolerance stack analysis methods (context) - Scholz - 1995
4 Optimal firing sequences for CAT scans (context) - Penavic - 1994
2 the square of a Hamiltonian cycle in dense graphs (context) - Koml'os, S'arkozy et al. - 1996
2 Personal communication (context) - Koml'os - 1996
2 the P'osa-Seymour conjecture (context) - Koml'os, S'arkozy et al.
Documents on the same site (http://cis.poly.edu/chiang/): More
I/O Optimal Isosurface Extraction (Extended Abstract) - Chiang, Silva (Correct)
On the Maximum Scatter TSP (Extended Abstract) - Arkin, Chiang, Mitchell.. (1997) (Correct)
Optimal Shortest Path and Minimum-Link Path Queries Between.. - Chiang, Tamassia (1994) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC