Algorithmica Of Of DOI: 10.1007/s00453-004-1124-z Algorithmica (2004) OF1-OF33 Algorithmica 2004 ...  Home/Search
Context
Related
| poly.edu/chiang/TS...rithmicaFinal.pdf Cached: 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.
PS.gz PS Image Update HelpFrom: poly.edu/chiang/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the following maximum scatter traveling salesperson problem (TSP): given an edgeweighted complete graph (S, E), find a Hamiltonian path or cycle such that the length of a shortest edge is maximized. In other words, the goal is to have each point far away (most "scattered") from the points that are visited just before or just after it in the path/cycle. This is also referred to as the max-min 1-neighbor TSP. More generally, in the max-min m-neighbor TSP problem, the goal is to... (Update)
Active bibliography (related documents): More All
1.8: On the Maximum Scatter TSP - Arkin, Chiang, Mitchell, Skiena, Yang (1996) (Correct)
1.4: On The Maximum Scatter Tsp - To Appear In (Correct)
0.5: On Computing Mobile Agent Routes for Data Fusion.. - Wu, Rao, Barhen.. (2004) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ of-doi,
author = "Algorithmica Of Of",
title = "DOI: 10.1007/s00453-004-1124-z",
url = "citeseer.ist.psu.edu/765018.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
40 On representatives of subsets (context) - Hall - 1935
11 Guaranteed performance heuristics for the bottleneck traveli.. (context) - Parker, Rardin - 1984
11 Simplicity and hardness of the maximum traveling salesman pr.. - Fekete - 1999
5 Coordination hole tolerance stacking (context) - Scholz - 1993
4 Optimal firing sequences for CAT scans (context) - Penavic - 1994
4 Tolerance stack analysis methods (context) - Scholz - 1995
3 The Traveling Salesman Problem and Its Variations - Gutin, Punnen - 2002
2 The geometric maximum traveling salesman problem - Barvinok, Fekete et al. - 2003
2 Cylinder section tolerance stacking issues (context) - Scholz - 1994
2 Tolerance stack analysis methods a critical review (context) - Scholz - 1995
2 the square of a Hamiltonian cycle in dense graphs (context) - Komlos, Sarkozy et al. - 1996
1 Coordination hole tolerance stacking panelpanelstringer join (context) - hole, panel et al. - 1994
1 the maximum scatter traveling salesperson problem (context) - Arkin, Chiang et al. - 1999
1 The maximum TSP (context) - Barvinok, Kh et al. - 2002
1 The bottleneck TSP (context) - Kabadi, Punnen - 2002
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