667 search results - page 30 / 134 » Approximation algorithms for connected facility location pro... |
ESA
2005
Springer
15 years 6 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...
89
Voted
FSTTCS
2009
Springer
15 years 7 months ago
2009
Springer
We introduce and study the donation center location problem, which has an additional application in network testing and may also be of independent interest as a general graph-theor...
129
Voted
MOR
2000
15 years 5 days ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
114
Voted
ADHOCNOW
2008
Springer
15 years 6 months ago
2008
Springer
Abstract. The Minimum-Power k-Connected Subgraph (MPkCS) problem seeks a power (range) assignment to the nodes of a given wireless network such that the resulting communication (su...
114
Voted
SIAMCOMP
2008
15 years 9 days ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...