112 search results - page 8 / 23 » Labeled Traveling Salesman Problems: Complexity and approxim... |
ICALP
2005
Springer
14 years 1 months ago
2005
Springer
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
CSC
2009
13 years 8 months ago
2009
- The Traveling Salesman Problem (TSP) is perhaps the most famous optimization problem in the set NP-hard. Many problems that are natural applications in computer science and engin...
ICANNGA
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. In wireless sensor networks where sensors are geographically deployed in 3D spaces, a mobile robot is required to travel to each sensor in order to download the data. The...
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 ...
COCO
2006
Springer
13 years 11 months ago
2006
Springer
We study two quite different approaches to understanding the complexity of fundamental problems in numerical analysis. We show that both hinge on the question of understanding the...