Sciweavers

1576 search results - page 27 / 316
» Streaming Algorithms for Independent Sets
Sort
View
VLDB
2005
ACM
86views Database» more  VLDB 2005»
15 years 3 months ago
One-Pass Wavelet Synopses for Maximum-Error Metrics
We study the problem of computing waveletbased synopses for massive data sets in static and streaming environments. A compact representation of a data set is obtained after a thre...
Panagiotis Karras, Nikos Mamoulis
CCCG
2010
14 years 11 months ago
Constrained k-center and movement to independence
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
Adrian Dumitrescu, Minghui Jiang
CORR
2008
Springer
86views Education» more  CORR 2008»
14 years 10 months ago
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
Johan M. M. van Rooij, Hans L. Bodlaender
JAIR
2007
87views more  JAIR 2007»
14 years 9 months ago
Supporting Temporal Reasoning by Mapping Calendar Expressions to Minimal Periodic Sets
In the recent years several research efforts have focused on the concept of time granularity and its applications. A first stream of research investigated the mathematical model...
Claudio Bettini, Sergio Mascetti, Xiaoyang Sean Wa...
SPAA
2010
ACM
15 years 2 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela