628 search results - page 33 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
106
Voted
AMAI
2008
Springer
15 years 2 months ago
2008
Springer
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
118
Voted
COCOON
1999
Springer
15 years 6 months ago
1999
Springer
Abstract: We propose a new approach for speeding up enumeration algorithms. The approach does not rely on data structures deeply, instead utilizes analysis of computation time. It ...
120
Voted
GECCO
1999
Springer
15 years 6 months ago
1999
Springer
The design and development of network infrastructure to support mission-critical operations has become a critical and complicated issue. In this study we explore the use of geneti...
122
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—With the explosive deployment of “triple play” (voice, video and data services) over the same access network, guaranteeing a certain-level of survivability for the access ne...
114
Voted
COCOON
2005
Springer
15 years 8 months ago
2005
Springer
The terminal Steiner tree problem (TST) consists of finding a minimum cost Steiner tree where each terminal is a leaf. We describe a factor 2ρ−ρ/(3ρ−2) approximation algor...