447 search results - page 34 / 90 » Approximation Algorithms for Directed Steiner Problems |
116
click to vote
TPDS
2008
15 years 2 months ago
2008
We study the problem of constructing a data gathering tree over a wireless sensor network in order to minimize the total energy for compressing and transporting information from a ...
101
Voted
AAIM
2010
Springer
15 years 5 months ago
2010
Springer
Given two genomic maps G and H represented by a sequence of n gene markers, a strip (syntenic block) is a sequence of distinct markers of length at least two which appear as subseq...
122
click to vote
CORR
2006
Springer
15 years 2 months ago
2006
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
103
click to vote
SECON
2010
IEEE
15 years 8 days ago
2010
IEEE
In this paper, we address several problems that arise in the context of rotating directional sensors. Rotating directional sensors (RDS) have a "directional" coverage reg...
135
click to vote
FOCS
2007
IEEE
15 years 8 months ago
2007
IEEE
We show that any deterministic data-stream algorithm that makes a constant number of passes over the input and gives a constant factor approximation of the length of the longest i...