28 search results - page 2 / 6 » Prize-collecting Network Design on Planar Graphs |
CORR
2010
Springer
13 years 2 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
CORR
2010
Springer
13 years 6 months ago
2010
Springer
ESA
2005
Springer
13 years 11 months 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...
DIALM
2003
ACM
13 years 11 months ago
2003
ACM
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
COCOA
2009
Springer
13 years 10 months ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...