How good is the Chord algorithm?

Authors:
Constantinos Daskalakis;Ilias Diakonikolas;Mihalis Yannakakis
Affiliations:
CSAIL, MIT;Columbia University;Columbia University
Venue:
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Year:
2010

Citing 9
Cited 6

Shape from probing

Journal of Algorithms
&egr;-optimality for bicriteria programs and its application to minimum cost flows

Computing
The convergence rate of the sandwich algorithm for approximating convex functions

Computing
Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases

Journal of the ACM (JACM)
On the approximability of trade-offs and optimal access of Web sources

FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Multicriteria Optimization

Multicriteria Optimization
Efficiently computing succinct trade-off curves

Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Succinct approximate convex pareto curves

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems

SIAM Journal on Computing

The maximum hypervolume set yields near-optimal approximation

Proceedings of the 12th annual conference on Genetic and evolutionary computation
CoPhy: a scalable, portable, and interactive index advisor for large workloads

Proceedings of the VLDB Endowment
Approximation-guided evolutionary multi-objective optimization

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Efficiency-revenue trade-offs in auctions

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Approximation quality of the hypervolume indicator

Artificial Intelligence
A fast approximation-guided evolutionary multi-objective algorithm

Proceedings of the 15th annual conference on Genetic and evolutionary computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Chord algorithm is a popular, simple method for the succinct approximation of curves, which is widely used, under different names, in a variety of areas, such as, multiobjective and parametric optimization, computational geometry, and graphics. We analyze the performance of the chord algorithm, as compared to the optimal approximation that achieves a desired accuracy with the minimum number of points. We prove sharp upper and lower bounds, both in the worst case and average case setting.