WIOPT
2010
IEEE
13 years 6 months ago
2010
IEEE
Abstract--In a wireless network composed of randomly scattered nodes, the characterization of the distribution of the best signal quality received from a group of nodes is of prima...
OL
2008
13 years 8 months ago
2008
Building on an existing 2-approximate algorithm for the class of network design problems with downwards-monotone demand functions, many of which are NP-hard, we present an algorith...
MP
2002
13 years 8 months ago
2002
We study the polyhedra of splittable and unsplittable single arc
MP
2002
13 years 8 months ago
2002
Abstract. This paper provides an analysis of capacitated network design cut
DISOPT
2008
13 years 8 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
SPAA
2004
ACM
14 years 1 months ago
2004
ACM
This paper presents the first polylogarithmic-competitive online algorithms for two-metric network design problems. These problems arise naturally in the design of computer netwo...
FOCS
2008
IEEE
14 years 3 months ago
2008
IEEE
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...