Sciweavers

33 search results - page 1 / 7
» Moving-Target TSP and Related Problems
Sort
View
ESA
1998
Springer
145views Algorithms» more  ESA 1998»
13 years 9 months ago
Moving-Target TSP and Related Problems
Previous literature on the Traveling Salesman Problem (TSP) assumed that the sites to be visited are stationary. Motivated by practical applications, we introduce a time-dependent ...
Christopher S. Helvig, Gabriel Robins, Alexander Z...
CVPR
2009
IEEE
15 years 8 days ago
Active Stereo Tracking of Multiple Free-Moving Targets
This article presents a general approach for the active stereo tracking of multiple moving targets. The problem is formulated on the plane, where cameras are modeled as ”line ...
Helder Araújo, João P. Barreto, Luis...
ESA
2003
Springer
189views Algorithms» more  ESA 2003»
13 years 10 months ago
On the Complexity of Approximating TSP with Neighborhoods and Related Problems
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
Shmuel Safra, Oded Schwartz
IJCGA
2006
91views more  IJCGA 2006»
13 years 5 months ago
The Tsp and the Sum of its Marginal Values
This paper introduces a new notion related to the traveling salesperson problem (TSP) -the notion of the TSP ratio. The TSP ratio of a TSP instance I is the sum of the marginal va...
Moshe Dror, Yusin Lee, James B. Orlin, Valentin Po...
IPL
2002
118views more  IPL 2002»
13 years 4 months ago
Differential approximation results for the traveling salesman and related problems
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
Jérôme Monnot