Succinct approximate convex Pareto curves (extended abstract)

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 74-83

  Diakonikolas, Ilias ^a   Yannakakis, Mihalis ^a  

^a Fu Foundation School of Engineering and Applied Science   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMBINATORIAL MATHEMATICS; CONTROL THEORY; CURVE FITTING; EVOLUTIONARY ALGORITHMS; LINEAR PROGRAMMING; LINEARIZATION; MULTIOBJECTIVE OPTIMIZATION; OPTIMIZATION; PARETO PRINCIPLE; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS);

COMPACT REPRESENTATIONS; LINEAR COMBINATION (LC); LOWER BOUNDS; MARKOV DECISION PROCESSES (MDPS); MINIMUM SIZE; MULTI-OBJECTIVE OPTIMIZATION (MOP) PROBLEMS; OPTIMIZATION ROUTINES; PARETO CURVES; PARETO SETS; POLYNOMIAL-TIME;

CONVEX OPTIMIZATION;

EID: 58649115187     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. A. Aggarwal, H. Booth, J. O'Rourke, S. Suri, C.K. Yap. Finding minimal convex nested polygons. Inform. and Control, 83, pp. 98-110, 1989.
2. H. Brönnimann, M.T. Goodrich Almost Optimal Set Covers in Finite VC-Dimension. Discrete and Computational Geometry, 14(4): 463-479 (1995).
3. P. Carstensen. The complexity of some problems in parametric linear and combinatorial programming. PhD Thesis, University of Michigan, 1983.
4. R. Chandrasekaran. Minimal ratio spanning tree. Networks 7, pp. 335-342, 1977.
5. 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. J. Climacao, Ed. Multicriteria Analysis. Springer-Verlag, 1997.
7. K. Clarkson. Algorithms for polytope covering and approximation. WADS, 246-252, 1993.
8. K. Chatterjee, R. Majumdar, T.A. Henzinger. Markov Decision Processes with Multiple Objectives. STACS, 325-336, 2006.
9. I. Diakonikolas, M. Yannakakis. Small Approximate Pareto Sets for Bi-objective Shortest Paths and Other Problems. In Proc. APPROX, 2007.
10. M. Ehrgott. Multicriteria optimization, 2nd edition, Springer-Verlag, 2005.
11. M, Ehrgott, X. Gandibleux. An annotated bibliography of multiobjective combinatorial optimization problems. OR Spectrum 42, pp. 425-460, 2000.
12. K. Etessami, M, Kwiatkowska, M. Y. Vardi, and M. Yannakakis. Multi-Objective Model Checking of Markov Decision Processes. In Proc. TACAS, 2007.
13. J. Figueira, S. Greco, M. Ehrgott, eds. Multiple Criteria Decision Analysis: State of the Art Surveys, Springer, 2005.
14. D. Gusfield. Sensitivity Analysis for Combinatorial Optimization. PhD Thesis, UC Berkeley, 1980.
15. P. Hansen. Bicriterion Path Problems. Proc. 3rd Conf. Multiple Criteria Decision Making Theory and Application, pp. 109-127, Springer Verlag LNEMS 177, 1979.
16. V. Koltun, C. H. Papadimitirou. Approximately dominating representatives. Theoretical Computer Science, 371, pp. 148-154, 2007.
17. N. Meggido. Combinatorial Optimization with Rational Objective Functions. Math of OR, pp. 414-424, 1979.
18. N. Meggido. Applying Parallel Computation Algorithms in the Design of Serial Algoritmhs. JACM, pp. 852-865, 1983.
19. K. M. Miettinen. Nonlinear Multiobjective Optimization, Kluwer, 1999.
20. J. Mitchell and S. Suri. Separation and Approximation of Polyhedral Objects. SODA, pp. 296-306, 1992.
21. J. Matoušek, R, Seidel, E. Welzl. How to net a lot with little: small ε-nets for disks and halfspaces. SoCG, pp. 16-22, 1990.
22. C.H. Papadimitriou, M. Yannakakis. On the Approximability of Trade-offs and Optimal Access of Web Sources. In Proceedings 41st IEEE Symp. on Foundations of Computer Science, 2000.
23. C.H. Papadimitriou, M. Yannakakis. Multiobjective Query Optimization. In Proc. PODS 2001.
24. G. Ruhe and B. Fruhwirth. Epsilon-optimality for biciteria programs and its application to minimum cost flows. Computing, 44, pp. 21-34, 1990.
25. G. Ruhe. Complexity results for multicriteria and parametric network flows using a pathological graph of Zadeh. Zeitschrift fur Operations Research, 32, pp. 9-27, 1988.
26. S. Ruzika, M. M. Wiecek. Approximation Methods in Multiobjective Programming (Survey paper). J. Opt. Th. and Appl., 126(3), pp. 473-501, 2005.
27. P. Van Mieghen, L. Vandenberghe. Trade-off Curves for QoS Routing. In Proc. INFOCOM, 2006.
28. S. Vassilvitskii, and M. Yannakakis. Efficiently computing succinct trade-off curves. Theoretical Computer Science 348, pp. 334-356, 2005.
29. A. Warburton. Approximation of Pareto Optima in Multiple-Objective Shortest Path Problems. Operations Research, 35, pp. 70-79, 1987.
30. M. Zeleny. Linear Multiobjective Programming, Springer, 1974.