324 search results - page 15 / 65 » Distance Approximating Trees: Complexity and Algorithms |
146
click to vote
STOC
2007
ACM
16 years 15 hour ago
2007
ACM
In the MINIMUM BOUNDED DEGREE SPANNING TREE problem, we are given an undirected graph with a degree upper bound Bv on each vertex v, and the task is to find a spanning tree of min...
CIAC
2010
Springer
15 years 3 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
122
click to vote
ALGOSENSORS
2009
Springer
15 years 6 months ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
111
click to vote
BMCBI
2006
14 years 11 months ago
2006
Background: The estimation of the difference between two evolutionary distances within a triplet of homologs is a common operation that is used for example to determine which of t...
103
click to vote
TSP
2008
14 years 11 months ago
2008
The two-band discrete wavelet transform (DWT) provides an octave-band analysis in the frequency domain, but this might not be "optimal" for a given signal. The discrete w...