Approximation with a Fixed Number of Solutions of Some Biobjective Maximization Problems
暂无分享,去创建一个
[1] Gerhard J. Woeginger,et al. A polynomial-time approximation scheme for maximizing the minimum machine completion time , 1997, Oper. Res. Lett..
[2] Evripidis Bampis,et al. Approximation algorithms for the bi-criteria weighted MAX-CUT problem , 2006, Discret. Appl. Math..
[3] Evripidis Bampis,et al. (Non)-Approximability for the Multi-criteria TSP(1, 2) , 2005, FCT.
[4] Johan Håstad,et al. Some optimal inapproximability results , 2001, JACM.
[5] Paolo Serafini,et al. Some Considerations about Computational Complexity for Multi Objective Combinatorial Problems , 1987 .
[6] Clifford Stein,et al. On the existence of schedules that are near-optimal for both makespan and total weighted completion time , 1997, Oper. Res. Lett..
[7] Arthur Warburton,et al. Approximation of Pareto Optima in Multiple-Objective, Shortest-Path Problems , 1987, Oper. Res..
[8] Bodo Manthey,et al. On Approximating Multi-Criteria TSP , 2007, STACS.
[9] Jiawei Zhang,et al. Improved approximations for max set splitting and max NAE SAT , 2004, Discret. Appl. Math..
[10] J. Edmonds. Paths, Trees, and Flowers , 1965, Canadian Journal of Mathematics.
[11] Pierre Hansen,et al. Bicriterion Path Problems , 1980 .
[12] Matthias Ehrgott,et al. Multicriteria Optimization , 2005 .
[13] Paola Alimonti,et al. Non-Oblivious Local Search for Grpah and Hyperpraph Coloring Problems , 1995, WG.
[14] Ronald L. Rivest,et al. Introduction to Algorithms, third edition , 2009 .
[15] Aleksander Madry,et al. A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem , 2008, APPROX-RANDOM.
[16] Christos D. Zaroliagis,et al. Multiobjective Optimization: Improved FPTAS for Shortest Paths and Non-Linear Objectives with Applications , 2006, Theory of Computing Systems.
[17] Uri Zwick,et al. A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems , 2001, Random Struct. Algorithms.
[18] Evripidis Bampis,et al. On the approximate tradeoff for bicriteria batching and parallel machine scheduling problems , 2003, Theor. Comput. Sci..
[19] R. K. Shyamasundar,et al. Introduction to algorithms , 1996 .
[20] 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.
[21] Daniel Vanderpooten,et al. Implementing an efficient fptas for the 0-1 multi-objective knapsack problem , 2009, Eur. J. Oper. Res..
[22] Hans Kellerer,et al. Approximating Multiobjective Knapsack Problems , 2002, Manag. Sci..
[23] Uri Zwick,et al. Approximation algorithms for constraint satisfaction problems involving at most three variables per constraint , 1998, SODA '98.
[24] Alessandro Panconesi,et al. Approximability of Maximum Splitting of k-Sets and Some Other Apx-Complete Problems , 1996, Inf. Process. Lett..
[25] David P. Williamson,et al. Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming , 1995, JACM.