833 search results - page 5 / 167 » Simpler and better approximation algorithms for network desi... |
124
Voted
NOSSDAV
2005
Springer
15 years 9 months ago
2005
Springer
In this position paper, we examine recent technology trends that have resulted in a broad spectrum of camera sensors, wireless radio technologies, and embedded sensor platforms wi...
251
Voted
WADS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
119
Voted
PODS
2006
ACM
16 years 3 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
146
Voted
STACS
2007
Springer
15 years 9 months ago
2007
Springer
We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed ...
135
Voted
IPCO
1993
15 years 5 months ago
1993
The survivable network design problem (SNDP) is to construct a minimum-cost subgraph satisfying certain given edge-connectivity requirements. The first polynomial-time approximati...