534 search results - page 5 / 107 » Tight approximation algorithm for connectivity augmentation ... |
JCO
2007
14 years 9 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-...
COCOA
2008
Springer
14 years 11 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...
175
click to vote
ICDT
2009
ACM
15 years 10 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...
JCO
2008
14 years 9 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...
COCOA
2007
Springer
14 years 11 months ago
2007
Springer
