How good is the Chord algorithm?

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2010, Pages 978-991

  Daskalakis, Constantinos ^a   Diakonikolas, Ilias ^b   Yannakakis, Mihalis ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Columbia University ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; CURVE FITTING;

AVERAGE CASE; CHORD ALGORITHM; MULTI OBJECTIVE; OPTIMAL APPROXIMATION; PARAMETRIC OPTIMIZATION; SIMPLE METHOD; UPPER AND LOWER BOUNDS;

APPROXIMATION ALGORITHMS;

EID: 77951669911     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973075.79     Document Type: Conference Paper

References (24)

1. [AN] Y. P. Aneja, K. P. K. Nair. Bicriteria transportation problems. Management Science, pp. 73-78, 1979.
2. [Ar] Archimedes. Quadrature parabolae. Archimedis opera omnia, vol II, J. L. Heiberg (ed.), B. G. Teubner, Leibzig, pp. 261-315, 1913.
3. [BHR] R. E. Burkard and H. W. Hamacher and G. Rote. Sandwich approximation of univariate convex functions with an application to separable convex programming. Naval Res. Logistics, 38, pp. 911-924, 1991.
4. [CCS] J. Cohon, R. Church, D. Sheer. Generating multiobjective tradeoffs: An algorithm for the bicriterion problem. Water Resources Research 15, pp. 1001-1010, 1979. (Pubitemid 10426197)
5. [CHSB] D. L. Craft, T. F. Halabi, H. A. Shih, T. R. Bortfeld. Approximating convex Pareto surfaces in multiobjective radiotherapy planning. Med. Phys., 33, pp. 3399-3407, 2006.
6. [CY] R. Cole, C. Yap. Shape from probing. J. Algorithms 8, pp. 19-38, 1987.
7. [DP] D. Douglas, T. Peucker. Algorithms for the reductions of the number of points required to represent a digitized line or its caricature. The Canadian Cartographer 10(2), pp. 112-122, 1973.
8. [DY] I. Diakonikolas, M. Yannakakis. Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems. To appear in SIAM J. on Computing, 2009.
9. [DY2] I. Diakonikolas, M. Yannakakis. Succinct Approximate Convex pareto Curves. Proc. ACM-SIAM Symp. on Discrete Algorithms, pp. 74-83, 2008.
10. [Ehr] M. Ehrgott. Multicriteria optimization, 2nd edition, Springer-Verlag, 2005.
11. [EG] M. Ehrgott, X. Gandibleux. An annotated bibliography of multiobjective combinatorial optimization problems. OR Spectrum 42, pp. 425-460, 2000.
12. [ES] M. J. Eisner, D. G. Severance. Mathematical techniques for efficient record segmentaton in large shared databases. J. ACM 23(4), pp. 619-635, 1976.
13. [FBR] B. Fruhwirth, R. E. Burkard, G. Rote. Approximation of convex curves with application to the bicriteria minimum cost flow problem. European J. of Operational Research 42, pp. 326-338, 1989.
14. [FGE] J. Figueira, S. Greco, M. Ehrgott, eds. Multiple Criteria Decision Analysis: State of the Art Surveys, Springer, 2005.
15. [LB] M. Lindenbaum, A. M. Bruckstein. Blind approximation of planar convex sets. IEEE Trans. on Robotics and Automation 10(4), pp. 517-529, 1994.
16. [Mit] K. M. Miettinen. Nonlinear Multiobjective Optimization, Kluwer, 1999.
17. [PY1] C.H.Papadimitriou, M.Yannakakis. On the Approximability of Trade-offs and Optimal Access of Web Sources. Proc. 41st IEEE Symp. on Foundations of Computer Science, 2000.
18. [Ra] U. Ramer. An iterative procedure for the polygonal approximation of plane curves. Computer Graphics and Image Processing 1, pp. 244-256, 1972.
19. [Ro] G. Rote. The convergence rate of the sandwich algorithm for approximating convex functions. Computing, 48, pp. 337-361, 1992.
20. [RF] G. Ruhe and B. Fruhwirth. Epsilon-optimality for bicriteria programs and its application to minimum cost flows. Computing ,44, pp. 21-34, 1990.
21. [RW] S. Ruzika, M. M. Wiecek. Approximation Methods in Multiobjective Programming (Survey paper). J. Opt. Th. and Appl., 126(3), pp. 473-501, 2005.
22. [VV] P. Van Mieghen, L. Vandenberghe. Trade-off Curves for QoS Routing. In Proc. INFOCOM, 2006.
23. [VY] S. Vassilvitskii, M. Yannakakis. Efficiently computing succinct trade-off curves. Theoretical Computer Science 348, pp. 334-356, 2005. (Preliminary version in Proc. ICALP, pp. 1201-1213, 2004.) (Pubitemid 43300799)
24. [YG] X. Yang, C. Goh. A method for convex curve approximation. European J. of Oper. Res. 97, pp. 205-212, 1997.