272 search results - page 22 / 55 » An Approximation Algorithm for a Bottleneck Traveling Salesm... |
SASO
2007
IEEE
14 years 1 months ago
2007
IEEE
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
APNOMS
2006
Springer
13 years 11 months ago
2006
Springer
This paper shows that geographic information system can successfully solve TSP (travelling salesman problem). It has been done using a module of the designed and implemented by aut...
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
This paper explores a novel setting for compressed sensing (CS) in which the sampling trajectory length is a critical bottleneck and must be minimized subject to constraints on th...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
We propose a protocol for a local search and a genetic algorithm for the distributed traveling salesman problem (TSP). In the distributed TSP, information regarding the cost funct...