272 search results - page 10 / 55 » An Approximation Algorithm for a Bottleneck Traveling Salesm... |
SODA
2001
ACM
13 years 8 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
Parallel genetic algorithms (PGAs) have been developed to reduce the large execution times that are associated with serial genetic algorithms (SGAs). They have also been used to s...
SIAMCOMP
2008
13 years 7 months ago
2008
We give an algorithm requiring O(c1/2 n) time to find an -optimal traveling salesman tour in the shortest-path metric defined by an undirected planar graph with nonnegative edgele...
GECCO
2011
Springer
12 years 10 months ago
2011
Springer
The generalized traveling salesman problem (GTSP) is an NPhard problem that extends the classical traveling salesman problem by partitioning the nodes into clusters and looking fo...
PPSN
2010
Springer
13 years 5 months ago
2010
Springer
We present a hybrid Genetic Algorithm that incorporates the Generalized Partition Crossover (GPX) operator to produce an algorithm that is competitive with the state of the art for...