Sciweavers

42 search results - page 9 / 9
» Approximating Minimum Max-Stretch spanning Trees on unweight...
Sort
View
ACID
2006
220views Algorithms» more  ACID 2006»
13 years 6 months ago
Vertex and Edge Covers with Clustering Properties: Complexity and Algorithms
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
Henning Fernau, David Manlove
TSP
2008
101views more  TSP 2008»
13 years 4 months ago
Optimal Node Density for Detection in Energy-Constrained Random Networks
The problem of optimal node density maximizing the Neyman-Pearson detection error exponent subject to a constraint on average (per node) energy consumption is analyzed. The spatial...
Animashree Anandkumar, Lang Tong, Ananthram Swami