How Good is the Chord Algorithm?
暂无分享,去创建一个
[1] Günther Ruhe,et al. ε-Optimality for bicriteria programs and its application to minimum cost flows , 1990, Computing.
[2] Y. Aneja,et al. BICRITERIA TRANSPORTATION PROBLEM , 1979 .
[3] Dennis G. Severance,et al. Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases , 1976, JACM.
[4] Mihalis Yannakakis,et al. Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems , 2009, SIAM J. Comput..
[5] Piet Van Mieghem,et al. Trade-Off Curves for QoS Routing , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.
[6] Richard Cole,et al. Shape from Probing , 1987, J. Algorithms.
[7] David L Craft,et al. Approximating convex pareto surfaces in multiobjective radiotherapy planning. , 2006, Medical physics.
[8] Kaisa Miettinen,et al. Nonlinear multiobjective optimization , 1998, International series in operations research and management science.
[9] Xavier Gandibleux,et al. A survey and annotated bibliography of multiobjective combinatorial optimization , 2000, OR Spectr..
[10] Mihalis Yannakakis,et al. Succinct approximate convex pareto curves , 2008, SODA '08.
[11] Mihalis Yannakakis,et al. On the approximability of trade-offs and optimal access of Web sources , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[12] Matthias Ehrgott,et al. Multiple criteria decision analysis: state of the art surveys , 2005 .
[13] Sergei Vassilvitskii,et al. Efficiently computing succinct trade-off curves , 2005, Theor. Comput. Sci..
[14] G. Rote,et al. Sandwich approximation of univariate convex functions with an application to separable convex programming , 1991 .
[15] S. Ruzika,et al. Approximation Methods in Multiobjective Programming , 2005 .
[16] Alfred M. Bruckstein,et al. Blind approximation of planar convex sets , 1994, IEEE Trans. Robotics Autom..
[17] Günter Rote,et al. The convergence rate of the sandwich algorithm for approximating convex functions , 1992, Computing.
[18] Matthias Ehrgott,et al. Multicriteria Optimization , 2005 .
[19] C. Goh,et al. A method for convex curve approximation , 1997 .
[20] J. Cohon,et al. Generating multiobjective trade-offs: an algorithm for bicriterion problems , 1979 .
[21] Urs Ramer,et al. An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..
[22] David H. Douglas,et al. ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .