301 search results - page 13 / 61 » The k-Median Problem for Directed Trees |
FSTTCS
2008
Springer
13 years 8 months ago
2008
Springer
ABSTRACT. We study the problem of space-efficient polynomial-time algorithms for directed stconnectivity (STCON). Given a directed graph G, and a pair of vertices s, t, the STCON ...
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
Several centralized and distributed algorithms have been recently proposed to maximize the multicast lifetime for directional communications in wireless ad-hoc networks. Their per...
DAM
2010
13 years 7 months ago
2010
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...
ISRR
2001
Springer
13 years 12 months ago
2001
Springer
This paper describes the foundations and algorithms of a new probabilistic roadmap (PRM) planner that is: (1) singlequery –i.e., it does not pre-compute a roadmap, but uses the ...
ESA
2004
Springer
14 years 27 days ago
2004
Springer
We obtain the following results related to dynamic versions of the shortest-paths problem: (i) Reductions that show that the incremental and decremental singlesource shortest-paths...