628 search results - page 83 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
234
click to vote
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
Abstract-- We investigate the problem of clustering on distributed data streams. In particular, we consider the k-median clustering on stream data arriving at distributed sites whi...
102
click to vote
ESA
2007
Springer
15 years 9 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
104
click to vote
TALG
2010
15 years 1 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
135
click to vote
APPROX
2008
Springer
15 years 5 months ago
2008
Springer
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
123
click to vote
ICALP
2003
Springer
15 years 8 months ago
2003
Springer
We consider requests for capacity in a given tree network T = (V, E) where each edge of the tree has some integer capacity ue. Each request consists of an integer demand df and a ...