Decision-making based on approximate and smoothed Pareto curves

Theoretical Computer Science

Volumn 378, Issue 3, 2007, Pages 253-270

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

^a RWTH AACHEN UNIVERSITY   (Germany)

Author keywords

Decision making; Multicriteria optimization; Pareto curve; Smoothed analysis

Indexed keywords

APPROXIMATION THEORY; DECISION MAKING; MATHEMATICAL MODELS; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

MULTICRITERIA OPTIMIZATION; PARETO CURVES; SMOOTHED ANALYSIS; SPANNING TREE;

PARETO PRINCIPLE;

EID: 34248372004     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2007.02.034     Document Type: Article

References (18)

1. Pankaj K. Agarwal, David Eppstein, Leonidas J. Guibas, Monika Rauch Henzinger, Parametric and kinetic minimum spanning trees, in: IEEE Symposium on Foundations of Computer Science, 1998, pp. 596-605
2. Barahona F., and Pulleyblank W.R. Exact arborescences, matchings and cycles. Discrete Applied Mathematics 16 (1987) 91-99
3. Beier R., and Vöcking B. Random knapsack in expected polynomial time. Journal of Computer and System Sciences 69 3 (2004) 306-329
4. René Beier, Berthold 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, 2004, pp. 343-352
5. Tamal K. Dey, Improved bounds on planar k-sets and k-levels, in: IEE Symposium on Foundations of Computer Science, 1997, pp. 165-161
6. Ehrgott M. Multicriteria Optimization. Lecture Notes in Economics and Mathematical Systems vol. 491 (2000), Springer-Verlag
7. Hansen P. Bicriterion path problems. Multiple Criteria Decision Making: Theory and Applications. Lecture Notes in Economics and Mathematical Systems vol. 177 (1980) 109-127
8. Henig M.I. The shortest path problem with two objective functions. European Journal of Operational Research 25 2 (1986) 281-291
9. Horst R., and Tuy H. Global Optimization (1990), Springer-Verlag
10. Katoh N. Bicriteria network optimization problems. IEICE Transactions Fundamentals of Electronics, Communications and Computer Sciences E75-A (1992) 321-329
11. Mulmuley K., Vazirani U.V., and Vazirani V.V. Matching is as easy as matrix inversion. Combinatorica 7 1 (1987) 105-114
12. Papadimitriou C.H., and Yannakakis M. The complexity of restricted spanning tree problems. Journal of the ACM 29 2 (1982) 285-309
13. Papadimitriou C.~H., and Yannakakis M. On the approximability of trade-offs and optimal access of web sources. FOCS '00: Proceedings of the 41st Annual Symposium on Foundations of Computer Science (2000), IEEE Computer Society 86-92
14. Spielman D.~A., and Teng S.-H. Smoothed analysis of algorithms: Why the simplex algorithm usually takes polynomial time. Journal of the ACM 51 3 (2004) 385-463
15. Tsaggouris G., and Zaroliagis C. Non-additive shortest paths. Algorithms - ESA 2004. Lecture Notes of Computer Science vol. 3221 (2004) 822-834
16. George Tsaggouris, Christos Zaroliagis, Improved FPTAS for multiobjective shortest paths with applications. Technical Report TR-2005/07/03, Computer Technology Institute, Patras, July 2005
17. Vassilvitskii S., and Yannakakis M. Efficiently computing succinct trade-off curves. Theoretical Computer Science 348 2-3 (2005) 334-356
18. Warburton A. Approximation of Pareto optima in multiple-objective, shortest-path problems. Operations Research 35 1 (1987) 70-78