534 search results - page 5 / 107 » Tight approximation algorithm for connectivity augmentation ... |
114
Voted
JCO
2007
15 years 1 months ago
2007
Let G = (V, E) be a connected multigraph, whose edges are associated with labels specified by an integer-valued function L : E → N. In addition, each label ℓ ∈ N has a non-...
82
Voted
COCOA
2008
Springer
15 years 2 months ago
2008
Springer
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
203
Voted
ICDT
2009
ACM
16 years 1 months ago
2009
ACM
In this paper we investigate algorithms and lower bounds for summarization problems over a single pass data stream. In particular we focus on histogram construction and K-center c...
100
Voted
JCO
2008
15 years 1 months ago
2008
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
101
Voted
COCOA
2007
Springer
15 years 2 months ago
2007
Springer
