667 search results - page 49 / 134 » Approximation algorithms for connected facility location pro... |
104
Voted
CATS
2007
15 years 1 months ago
2007
We consider the problem of constructing a shortest Euclidean 2-connected Steiner network (SMN) for a set of terminals. This problem has natural applications in the design of survi...
91
Voted
SODA
1997
ACM
15 years 1 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
105
Voted
STOC
2003
ACM
16 years 23 days ago
2003
ACM
We initiate an investigation of sublinear algorithms for geometric problems in two and three dimensions. We give optimal algorithms for intersection detection of convex polygons a...
108
Voted
MOBIHOC
2006
ACM
16 years 2 days ago
2006
ACM
Localization is an important and extensively studied problem in ad-hoc wireless sensor networks. Given the connectivity graph of the sensor nodes, along with additional local info...
109
Voted
PERCOM
2010
ACM
14 years 11 months ago
2010
ACM
In this paper, we explore how to effectively create and use "instant mesh networks", i.e., wireless mesh networks that are dynamically deployed in temporary circumstances...