Algorithms column: sublinear time algorithms

@article{Kumar2003AlgorithmsCS,
  title={Algorithms column: sublinear time algorithms},
  author={Ravi Kumar and Ronitt Rubinfeld},
  journal={SIGACT News},
  year={2003},
  volume={34},
  pages={57-67}
}
With the recent tremendous increase in computational power and cheap storage, we are blessed with a multitude of available, and possibly useful, information. It is always nice to have something for (almost) nothing. However, this blessing is also something of a curse, for we may also be asked to do something meaningful with all of this data. The scale of these data sets, coupled with the typical situation in which there is very little time to perform our computations, raises the question of… Expand
Something for (Almost) Nothing: New Advances in Sublinear-Time Algorithms
TLDR
This chapter focuses on a formalization of approximate solutions that has been widely studied in an area of theoretical computer science known as property testing, and a close connection between property testing and the general parameter estimation. Expand
Separating sublinear time computations by approximate diameter
TLDR
It is shown that, for any parameter r∈(0,1), the bounded error randomized sublinear time computation in time O(nr) cannot be simulated by any zero error randomizedSublinear time algorithm in o(n) time or queries; and the same is true forzero error randomized computation versus deterministic computation. Expand
Algebraic Property Testing
Modern computational tasks often involve large amounts of data, and efficiency is a very desirable feature of such algorithms. Local algorithms are especially attractive, since they can imply globalExpand
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the solution of a related subproblem ofExpand
Sampling subproblems of heterogeneous Max-Cut problems and approximation algorithms
TLDR
An algorithm is developed and analyzed which uses a novel sampling method to obtain improved bounds for approximating the Max-Cut of a graph and it is shown that by judicious choice of sampling probabilities one can obtain error bounds that are superior to the ones obtained by uniform sampling. Expand
Separating Sublinear Time Computations by Approximate Diameter
TLDR
A class of separations about the sublinear time computations are obtained using various versions of the approximate diameter problem based on the restriction about the format of input data. Expand
Sublinear-time approximation algorithms for clustering via random sampling
We present a novel analysis of a random sampling approach for four clustering problems in metric spaces: k-median, k-means, min-sum k-clustering, and balanced k-median. For all these problems, weExpand
On-line approximate string matching with bounded errors
TLDR
This work introduces a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to miss occurrences with probability, and shows that the relaxed version of the problem allows for breaking the average-case optimal lower bound of the classical problem. Expand
An improved constant-time approximation algorithm for maximum~matchings
TLDR
An algorithm to approximate the size of some maximal independent set with additive error ε n whose running time is O(d2) is presented, and it is shown that there are approximation algorithms for many other problems, e.g., the maximum matching problem, the minimum vertex cover problem, and the minimum set cover problems, that run exponentially faster than existing algorithms. Expand
Beyond worst-case analysis for joins with minesweeper
TLDR
A new algorithm is described, Minesweeper, that is able to satisfy stronger runtime guarantees than previous join algorithms (colloquially ``beyond worst-case'' guarantees) for data in indexed search trees and a dichotomy theorem is developed for the certificate-based notion of complexity. Expand
...
1
2
3
...

References

SHOWING 1-10 OF 29 REFERENCES
Quick Approximation to Matrices and Applications
TLDR
The matrix approximation is generalized to multi-dimensional arrays and from that derive approximation algorithms for all dense Max-SNP problems and the Regularity Lemma is derived. Expand
Random sampling and approximation of MAX-CSP problems
TLDR
A new efficient sampling method for approximating r-dimensional Maximum Constraint Satisfaction Problems, MAX-rCSP, on n variables up to an additive error εnr, which gives for the first time a polynomial in ε—1 bound on the sample size necessary to carry out the above approximation. Expand
Better streaming algorithms for clustering problems
TLDR
A randomized algorithm for the k--Median problem which produces a constant factor approximation in one pass using storage space O(k poly log n) and gives bicriterion guarantees, producing constant factor approximations by increasing the allowed fraction of outliers slightly. Expand
On the strength of comparisons in property testing
  • E. Fischer
  • Computer Science, Mathematics
  • Inf. Comput.
  • 2001
TLDR
It is proved that an e-test for a property of integer sequences, such as the property of the sequence being a monotone non-decreasing sequence, cannot perform less queries than the best e- test which uses only comparisons between the queried values. Expand
Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems
We present a unified framework for designing polynomial time approximation schemes (PTASs) for “dense” instances of many NP-hard optimization problems, including maximum cut, graph bisection, graphExpand
Improved Testing Algorithms for Monotonicity
TLDR
Improved algorithms for testing monotonicity of functions are presented, given the ability to query an unknown function f: Σ n ↦ Ξ, and the test always accepts a monotone f, and rejects f with high probability if it is e-far from being monotones. Expand
Combinatorial property testing (a survey)
  • Oded Goldreich
  • Computer Science, Mathematics
  • Randomization Methods in Algorithm Design
  • 1997
TLDR
This work considers the question of determining whether a given object has a predetermined property or is \far" from any object having the property, and focuses on combinatorial properties, and speciically on graph properties. Expand
Data streams: algorithms and applications
TLDR
Data Streams: Algorithms and Applications surveys the emerging area of algorithms for processing data streams and associated applications, which rely on metric embeddings, pseudo-random computations, sparse approximation theory and communication complexity. Expand
Testing that distributions are close
TLDR
A sublinear algorithm which uses O(n/sup 2/3//spl epsiv//sup -4/ log n) independent samples from each distribution, runs in time linear in the sample size, makes no assumptions about the structure of the distributions, and distinguishes the cases when the distance between the distributions is small or large. Expand
Sublinear time approximate clustering
TLDR
This paper motivates and introduces a new model of clustering that is in the spirit of the “PAC (probably approximately correct)” learning model, and gives examples of efficient PAC-clustering algorithms. Expand
...
1
2
3
...