594 search results - page 80 / 119 » Travelling Miser Problem |
ESA
2008
Springer
13 years 9 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
GBRPR
2007
Springer
14 years 2 months ago
2007
Springer
The traveling salesperson problem (TSP) is difficult to solve for input instances with large number of cities. Instead of finding the solution of an input with a large number of c...
ATAL
2010
Springer
13 years 9 months ago
2010
Springer
We consider the problem of coordinating a team of agents engaged in executing a set of inter-dependent, geographically dispersed tasks in an oversubscribed and uncertain environme...
GIS
2008
ACM
13 years 9 months ago
2008
ACM
In a geographical route search, given search terms, the goal is to find an effective route that (1) starts at a given location, (2) ends at a given location, and (3) travels via...
DAC
2001
ACM
14 years 9 months ago
2001
ACM
Crosstalk effects degrade the integrity of signals traveling on long interconnects and must be addressed during manufacturing testing. External testing for crosstalk is expensive ...