How good is the chord algorithm?

MaRDI QIDQ5417682zbMATH OpenFDO

Authors Constantinos Daskalakis, Ilias Diakonikolas, Mihalis Yannakakis

Publication date 22 May 2014

Full work available at URL https://arxiv.org/abs/1309.7084

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• How good is the Chord algorithm?
• scientific article; zbMATH DE number 4082817
• Efficient algorithms for approximating polygonal chains
• scientific article; zbMATH DE number 6469145
• An optimal algorithm for polygonal approximation of digitized curves

Cited in

(3)

• How good is the Chord algorithm?
• Efficient optimization of many objectives by approximation-guided evolution
• Bi-directional search for robust routes in time-dependent bi-criteria road networks

This page was built for publication: How good is the chord algorithm?

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5417682)