344 search results - page 5 / 69 » The Directed Minimum Latency Problem |
133
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Given a directed graph G with non negative cost on the arcs, a directed tree cover of G is a directed tree such that either head or tail (or both of them) of every arc in G is touc...
129
click to vote
JDA
2007
15 years 4 months ago
2007
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
151
click to vote
STACS
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...
127
click to vote
INFOCOM
2006
IEEE
15 years 10 months ago
2006
IEEE
— Energy-efficient broadcast communication is an important problem in wireless ad hoc networks. Previously, minimum-energy broadcast that exploits the broadcast nature of radio ...
131
click to vote
ICC
2008
IEEE
15 years 11 months ago
2008
IEEE
: We study how to achieve a desired connectivity in a wireless mesh network using beamforming antennas. We show that there is no unique solution to this problem. Then, we propose a...