3678 search results - page 314 / 736 » On the Stable Paths Problem |
409
click to vote
INFOCOM
2012
IEEE
13 years 9 months ago
2012
IEEE
— Reliability and energy efficiency are critical issues in wireless sensor networks. In this work, we study Delay-bounded Energy-constrained Adaptive Routing (DEAR) problem with...
179
click to vote
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
In massively collaborative projects such as scientific or community databases, users often need to agree or disagree on the content of individual data items. On the other hand, tr...
156
click to vote
APPROX
2004
Springer
16 years 5 days ago
2004
Springer
We consider the problem of fitting metric data on n points to a path (line) metric. Our objective is to minimize the total additive distortion of this mapping. The total additive ...
185
click to vote
DLT
2008
15 years 8 months ago
2008
A graph H is computable if there is a graph G = (V, E) isomorphic to H where the set V of vertices and the edge relation E are both computable. In this case G is called a computabl...
153
click to vote
IPL
2010
15 years 5 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...