Separating Sublinear Time Computations by Approximate Diameter

Authors:
Bin Fu;Zhiyu Zhao
Affiliations:
Dept. of Computer Science, University of Texas - Pan American, USA TX 78539;Department of Computer Science, University of New Orleans, New Orleans, USA LA 70148
Venue:
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Year:
2008

Citing 11
Cited 0

Property testing and its connection to learning and approximation

Journal of the ACM (JACM)
Property testing in massive graphs

Handbook of massive data sets
Fast Monte-Carlo Algorithms for Approximate Matrix Multiplication

FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Algorithms column: sublinear time algorithms

ACM SIGACT News
Estimating the weight of metric minimum spanning trees in sublinear-time

STOC '04 Proceedings of the thirty-sixth 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
Sublinear Geometric Algorithms

SIAM Journal on Computing
On Sums of Independent Random Variables with Unbounded Variance and Estimating the Average Degree in a Graph

SIAM Journal on Computing
On Derandomizing Probabilistic Sublinear-Time Algorithms

CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Facility location in sublinear time

ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study sublinear time complexity and algorithm to approximate the diameter for a sequence S= p1p2驴 pnof points in a metric space, in which every pair of two consecutive points piand pi+ 1in the sequence Shas the same distance. The diameter of Sis the largest distance between two points piand pjin S. The approximate diameter problem is investigated under deterministic, zero error randomized, and bounded error randomized models. We obtain a class of separations about the sublinear time computations using various versions of the approximate diameter problem based on the restriction about the format of input data.