642 search results - page 101 / 129 » Approximation Algorithms for Minimum K-Cut |
117
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— Existing work on placing additional relay nodes in wireless sensor networks to improve network connectivity typically assumes homogeneous wireless sensor nodes with an identica...
114
Voted
ICALP
2005
Springer
15 years 8 months ago
2005
Springer
In this paper we initiate the study of the AND-OR directed feedback vertex set problem from the viewpoint of approximation algorithms. This AND-OR feedback vertex set problem is m...
118
Voted
INFOCOM
2007
IEEE
15 years 9 months ago
2007
IEEE
Abstract— This paper studies routing schemes and their distributed construction in limited wireless networks, such as sensor or mesh networks. We argue that the connectivity of s...
111
Voted
INFOCOM
2009
IEEE
15 years 9 months ago
2009
IEEE
—We develop diverse routing schemes for dealing with multiple, possibly correlated, failures. While disjoint path protection can effectively deal with isolated single link failur...
123
Voted
COMPGEOM
2006
ACM
15 years 8 months ago
2006
ACM
We study the problem of minimum-distortion embedding of ultrametrics into the plane and higher dimensional spaces. Ultrametrics are a natural class of metrics that frequently occu...