Efficiently computing succinct trade-off curves

Theoretical Computer Science

Volumn 348, Issue 2-3 SPEC. ISS., 2005, Pages 334-356

  Vassilvitskii, Sergei ^a   Yannakakis, Mihalis ^b  

^a STANFORD UNIVERSITY   (United States)

^b Och Spine at New York Presbyterian Hospitals   (United States)

Author keywords

Approximation algorithms; Multicriteria problems; Multiobjective optimization; Pareto set

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; OPTIMIZATION; PROBLEM SOLVING;

MULTICRITERIA PROBLEMS; MULTIOBJECTIVE OPTIMIZATION; PARETO SET;

COMPUTER SCIENCE;

EID: 33644534133     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2005.09.022     Document Type: Conference Paper

References (22)

1. A.F. Archer, Two O (log * k ) -approximation algorithms for the asymmetric k-center problem, Proc. 8th Conf. on Integer programming and Combinatorial Optimization, 2001, pp. 1-14.
2. T.C.E. Cheng, A. Janiak, and M.Y. Kovalyov Bicriterion single machine scheduling with resource dependent processing times SIAM J. Optim. 8 2 1998 617 630
3. J. Chuzhoy, private communication, 2004.
4. J. Chuzhoy, S. Guha, E. Halperin, S. Khanna, G. Kortsartz, S. Naor, Asymmetric k -center is log * n -hard to approximate, Proc. 36th ACM STOC, 2004, pp. 21-27.
5. J. Climacao Multicriteria Analysis 1997 Springer Berlin
6. M. Ehrgott Multicriteria Optimization 2000 Springer Berlin
7. F. Ergun, R. Sinha, and L. Zhang An improved FPTAS for restricted shortest path Inform. Process. Lett. 83 5 2002 237 293
8. U. Feige A threshold of ln n for approximating set cover JACM 45 4 1998 634 652
9. M.R. Garey, and D.S. Johnson Computers and Intractability 1979 W.H. Freeman New York
10. A. Goel, K.G. Ramakrishnan, D. Kataria, D. Logothetis. Efficient computation of delay-sensitive routes from one source to all destinations. Proc. IEEE INFOCOM, 2001.
11. S. Guha, D. Gunopoulos, N. Koudas, D. Srivastava, M. Vlachos, Efficient approximation of optimization queries under parametric aggregation constraints, Proc. 29th VLDB, 2003.
12. P. Hansen. Bicriterion path problems, Proc. 3rd Conf. Multiple Criteria Decision Making Theory and Application, Lecture Notes in Economics and Mathematical Systems, Vol. 177, Springer, Berlin, 1979, pp. 109-127.
13. R. Hassin Approximation schemes for the restricted shortest path problem Math. Oper. Res. 17 1 1992 36 42
14. O.H. Ibarra, and C.E. Kim Fast approximation algorithms for the knapsack and sum of subsets problem JACM 22 4 1975 463 468
15. V. Koltun, C.H. Papadimitirou. Approximately dominating representatives, Proc. Internat. Conf. Database Theory, Springer, Berlin, 2005, pp. 204-214.
16. D.H. Lorenz, and D. Raz A simple efficient approximation scheme for the restricted shortest path problem Oper. Res. Lett. 28 5 2001 213 219
17. C. Lund, and M. Yannakakis On the hardness of approximating minimization problems JACM 41 5 1994 960 981
18. R. Panigrahy, and S. Vishwanathan An O (log * n ) approximation algorithm for the asymmetric p-center problem J. Algorithms 27 2 1998 259 268
19. C.H. Papadimitriou, M. Yannakakis, On the approximability of trade-offs and optimal access of web sources, in: Proc. 41st IEEE Symp. on Foundations of Computer Science, 2000.
20. C.H. Papadimitriou, M. Yannakakis, Multiobjective query optimization, in: Proc. of PODS, 2001.
21. R. Ravi, M.V. Marathe, S.S. Ravi, D.J. Rosenkrantz, H.B. Hunt. Many birds with one stone: multi-objective approximation algorithms, Proc. 25th STOC, 1993, pp. 438-447.
22. A. Warburton Approximation of Pareto optima in multiple-objective shortest path problems Oper. Res. 35 1987 70 79