Intersection of convex objects in two and three dimensions
Journal of the ACM (JACM)
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Sublinear time algorithms for metric space problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Polynomial time approximation schemes for dense instances of NP -hard problems
Journal of Computer and System Sciences
Sublinear time approximate clustering
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms
Property Testing in Computational Geometry
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Property Testing with Geometric Queries
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
SIAM Journal on Discrete Mathematics
Property testing in massive graphs
Handbook of massive data sets
Better streaming algorithms for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
High-dimensional computational geometry
High-dimensional computational geometry
Algorithms column: sublinear time algorithms
ACM SIGACT News
Random sampling and approximation of MAX-CSPs
Journal of Computer and System Sciences - STOC 2002
Local Search Heuristics for k-Median and Facility Location Problems
SIAM Journal on Computing
On coresets for k-means and k-median clustering
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Optimal Time Bounds for Approximate Clustering
Machine Learning
A k-Median Algorithm with Running Time Independent of Data Size
Machine Learning
A Simple Linear Time (1+ ") -Approximation Algorithm for k-Means Clustering in Any Dimensions
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Fast monte-carlo algorithms for finding low-rank approximations
Journal of the ACM (JACM)
Quick k-Median, k-Center, and Facility Location for Sparse Graphs
SIAM Journal on Computing
Abstract Combinatorial Programs and Efficient Property Testers
SIAM Journal on Computing
Coresets in dynamic geometric data streams
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Approximating the Minimum Spanning Tree Weight in Sublinear Time
SIAM Journal on Computing
Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time
SIAM Journal on Computing
On k-Median clustering in high dimensions
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Sublinear Geometric Algorithms
SIAM Journal on Computing
Graph limits and parameter testing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
Tolerant property testing and distance approximation
Journal of Computer and System Sciences
Sublinear-time approximation algorithms for clustering via random sampling
Random Structures & Algorithms - Proceedings from the 12th International Conference “Random Structures and Algorithms”, August1-5, 2005, Poznan, Poland
Smaller Coresets for k-Median and k-Means Clustering
Discrete & Computational Geometry
A Characterization of the (Natural) Graph Properties Testable with One-Sided Error
SIAM Journal on Computing
Every minor-closed property of sparse graphs is testable
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Approximating average parameters of graphs
Random Structures & Algorithms
Every Monotone Graph Property Is Testable
SIAM Journal on Computing
Constant-Time Approximation Algorithms via Local Improvements
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
An improved constant-time approximation algorithm for maximum~matchings
Proceedings of the forty-first annual ACM symposium on Theory of computing
Testing Hereditary Properties of Nonexpanding Bounded-Degree Graphs
SIAM Journal on Computing
A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity
SIAM Journal on Computing
Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time
SIAM Journal on Computing
Small Space Representations for Metric Min-sum k-Clustering and Their Applications
Theory of Computing Systems - Special Issue: Theoretical Aspects of Computer Science; Guest Editors: Wolgang Thomas and Pascal Weil
Facility location in sublinear time
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Linear time algorithms for clustering problems in any dimensions
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Making queries tractable on big data with preprocessing: through the eyes of complexity theory
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
In this paperwe survey recent advances in the area of sublineartime algorithms.