206 search results - page 14 / 42 » Three Hoppy path problems and ternary paths |
SIGCOMM
2010
ACM
13 years 7 months ago
2010
ACM
Flow-based networks such as OpenFlow-based networks have difficulty handling a large number of flows in a node due to the capacity limitation of search engine devices such as tern...
IROS
2008
IEEE
14 years 2 months ago
2008
IEEE
— This paper presents a solution to the problem of steering a group of real omnidirectional mobile robots along a given path, while maintaining a desired formation pattern. This ...
ENTCS
2007
13 years 7 months ago
2007
In this paper, we survey algorithms for shortest paths in dynamic networks. Although research on this problem spans over more than three decades, in the last couple of years many ...
ESA
2003
Springer
14 years 24 days ago
2003
Springer
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 ...
COR
2008
13 years 6 months ago
2008
In this paper we review the exact algorithms proposed in the last three decades for the solution of the vehicle routing problem with time windows (VRPTW). The exact algorithms for...