Decision making based on approximate and smoothed Pareto curves

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3827 LNCS, Issue , 2005, Pages 675-684

  Ackermann, Heiner ^a   Newman, Alantha ^a   Röglin, Heiko ^a   Vöcking, Berthold ^a  

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

BICRITERIA OPTIMIZATION PROBLEMS; FAILURE PROBABILITY; OBJECTIVE FUNCTIONS; PSEUDOPOLYNOMIALS;

APPROXIMATION THEORY; FUNCTION EVALUATION; POLYNOMIALS; PROBABILISTIC LOGICS; PROBLEM SOLVING; RANDOM PROCESSES; TREES (MATHEMATICS);

DECISION MAKING;

EID: 33744960931     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_68     Document Type: Conference Paper

References (17)

1. Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, and Monika Rauch Henzinger. Parametric and kinetic minimum spanning trees. In IEEE Symposium on Foundations of Computer Science, pages 596-605, 1998.
2. F. Barahona and W.R. Pulleyblank. Exact arborescences, matchings and cycles. Discrete Applied Mathematics, 16:91-99, 1987.
3. R. Beier and B. Vöcking, Random Knapsack in Expected Polynomial Time. In Journal of Computer and System Sciences, volume 69(3), pages 306-329, 2004.
4. R. Beier and B. Vöcking. Typical Properties of Winners and Losers in Discrete Optimization. In Proc. of the 36th Annual ACM Symposium on Theory of Computing (STOC-2004), pages 343-352, 2004.
5. Tamal K. Dey. Improved bounds on planar k-sets and k-levels. In IEEE Symposium on Foundations of Computer Science, pages 165-161, 1997.
6. Matthias Ehrgott. Multicriteria Optimization. Lecture Notes in Economics and Mathematical Systems Vol. 491. Springer-Verlag, 2000.
7. P. Hansen. Bicriterion path problems. In Multiple Criteria Decision Making: Theory and Applications, volume 177 of Lecture Notes in Economics and Mathematical Systems, pages 109-127, 1980.
8. Mordechai I. Henig. The shortest path problem with two objective functions. European Journal of Operational Research, 25(2):281-291, 1986.
9. Reiner Horst and Hoang Tuy. Global Optimization. Springer-Verlag, 1990.
10. Naoki Katoh. Bicriteria network optimization problems. IEICE Transactions Fundamentals of Electronics, Communications and Computer Sciences, E75-A:321-329, 1992.
11. K. Mulmuley, U.V. Vazirani, and V.V. Vazirani. Matching is as easy as matrix inversion. Combinatorica, 7(1):105-114, 1987.
12. C.H. Papadimitriou and M. Yannakakis. The complexity of restricted spanning tree problems. Journal of the ACM, 29(2):285-309, 1982.
13. Christos H. Papadimitriou and Mihalis Yannakakis. On the approximability of trade-offs and optimal access of web sources, In FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science, pages 86-92. IEEE Computer Society, 2000.
14. D. A. Spielman and S.-H. Teng. Smoothed Analysis of Algorithms: Why The Simplex Algorithm Usually Takes Polynomial Time. In Journal of the ACM, volume 51(3), pages 385-463, 2004.
15. George Tsaggouris and Christos Zaroliagis. Non-additive shortest paths. In Algorithms - ESA 2004, Lecture Notes of Computer Sciene Vol. 3221, pages 822-834, 2004.
16. Sergei Vassilvitskii and Mihalis Yannakakis. Efficiently computing succinct tradeoff curves. In ICALP, pages 1201-1213, 2004.
17. Arthur Warburton. Approximation of Pareto optima in multiple-objective shortest-path problems. Operations Research, 35(1):70-78, 1987.