| dc.contributor.author | Yannakakis, Mihalis | |
| dc.contributor.author | Diakonikolas, Ilias | |
| dc.contributor.author | Daskalakis, Konstantinos | |
| dc.date.accessioned | 2018-03-30T20:18:39Z | |
| dc.date.available | 2018-03-30T20:18:39Z | |
| dc.date.issued | 2016-06 | |
| dc.date.submitted | 2015-08 | |
| dc.identifier.issn | 0097-5397 | |
| dc.identifier.issn | 1095-7111 | |
| dc.identifier.uri | http://hdl.handle.net/1721.1/114489 | |
| dc.description.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 settings. | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (CCF-07-28736) | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (CCF-10-17955) | en_US |
| dc.description.sponsorship | National Science Foundation (U.S.) (CCF-13-20654) | en_US |
| dc.publisher | Society for Industrial & Applied Mathematics | en_US |
| dc.relation.isversionof | http://dx.doi.org/10.1137/13093875X | en_US |
| dc.rights | Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use. | en_US |
| dc.source | Society for Industrial and Applied Mathematics | en_US |
| dc.title | How Good is the Chord Algorithm? | en_US |
| dc.type | Article | en_US |
| dc.identifier.citation | Daskalakis, Constantinos, Ilias Diakonikolas, and Mihalis Yannakakis. “How Good Is the Chord Algorithm?” SIAM Journal on Computing 45, no. 3 (January 2016): 811–858. © 2016, Society for Industrial and Applied Mathematics | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory | en_US |
| dc.contributor.department | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science | en_US |
| dc.contributor.mitauthor | Daskalakis, Konstantinos | |
| dc.relation.journal | SIAM Journal on Computing | en_US |
| dc.eprint.version | Final published version | en_US |
| dc.type.uri | http://purl.org/eprint/type/JournalArticle | en_US |
| eprint.status | http://purl.org/eprint/status/PeerReviewed | en_US |
| dc.date.updated | 2018-03-02T16:32:56Z | |
| dspace.orderedauthors | Daskalakis, Constantinos; Diakonikolas, Ilias; Yannakakis, Mihalis | en_US |
| dspace.embargo.terms | N | en_US |
| dc.identifier.orcid | https://orcid.org/0000-0002-5451-0490 | |
| mit.license | PUBLISHER_POLICY | en_US |
