1941 search results - page 185 / 389 » On Generalizations of Network Design Problems with Degree Bo... |
207
click to vote
ESA
2005
Springer
16 years 19 days ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
167
click to vote
REST
2010
ACM
15 years 11 months ago
2010
ACM
Traditionally, distributed computing problems have been solved by partitioning data into chunks able to be handled by commodity hardware. Such partitioning is not possible in case...
194
click to vote
MSWIM
2004
ACM
16 years 15 days ago
2004
ACM
This study addresses the problem of k-connectivity of a wireless multihop network consisting of randomly placed nodes with a common transmission range, by utilizing empirical regr...
178
click to vote
HM
2007
Springer
16 years 1 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
246
click to vote
MOBIHOC
2007
ACM
16 years 6 months ago
2007
ACM
We provide a general framework for the analysis of the capacity scaling properties in mobile ad-hoc networks with heterogeneous nodes and spatial inhomogeneities. Existing analyti...