99 search results - page 6 / 20 » Distance Approximation in Bounded-Degree and General Sparse ... |
STOC
2009
ACM
14 years 8 months ago
2009
ACM
The paper concerns graph spanners that are resistant to vertex or edge failures. Given a weighted undirected n-vertex graph G = (V, E) and an integer k 1, the subgraph H = (V, E ...
DAGSTUHL
2007
13 years 8 months ago
2007
We address the problem of finding sparse wavelet representations of high-dimensional vectors. We present a lower-bounding technique and use it to develop an algorithm for computi...
MFCS
2005
Springer
14 years 27 days ago
2005
Springer
Abstract. Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that eithe...
COMGEO
2007
ACM
13 years 7 months ago
2007
ACM
In this paper we investigate the relations between spanners, weak spanners, and power spanners in RD for any dimension D and apply our results to topology control in wireless netw...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
We consider the task of topology discovery of sparse random graphs using end-to-end random measurements (e.g., delay) between a subset of nodes, referred to as the participants. T...