2796 search results - page 23 / 560 » The coolest path problem |
FOCS
2003
IEEE
15 years 5 months ago
2003
IEEE
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...
COMPSAC
2002
IEEE
15 years 4 months ago
2002
IEEE
The problem of testing from an extended finite state machine (EFSM) is complicated by the presence of infeasible paths. This paper considers the problem of expanding an EFSM in o...
ATMOS
2010
14 years 10 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
104
click to vote
PVLDB
2010
14 years 10 months ago
2010
The current widespread use of location-based services and GPS technologies has revived interest in very fast and scalable shortest path queries. We introduce a new shortest path q...
COSIT
2009
Springer
15 years 6 months ago
2009
Springer
Human path planning relies on several more aspects than only geometric distance between two locations. These additional aspects mostly relate to the complexity of the traveled path...