630 search results - page 39 / 126 » Hardness results for approximating the bandwidth |
100
Voted
VLDB
2005
ACM
15 years 6 months ago
2005
ACM
This paper addresses the efficient processing of top-k queries in wide-area distributed data repositories where the index lists for the attribute values (or text terms) of a query...
119
Voted
SODA
2012
ACM
13 years 3 months ago
2012
ACM
The Densest k-subgraph problem (i.e. find a size k subgraph with maximum number of edges), is one of the notorious problems in approximation algorithms. There is a significant g...
102
click to vote
SODA
2010
ACM
15 years 10 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
96
Voted
KDD
2006
ACM
16 years 28 days ago
2006
ACM
Spatial scan statistics are used to determine hotspots in spatial data, and are widely used in epidemiology and biosurveillance. In recent years, there has been much effort invest...
118
Voted
WISE
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. Approximation has been identified as a potential way of reducing the complexity of logical reasoning. Here we explore approximation for speeding up instance retrieval in...