Approximation of min-max and min-max regret versions of some combinatorial optimization problems

European Journal of Operational Research

Volumn 179, Issue 2, 2007, Pages 281-290

  Aissi, Hassene ^a   Bazgan, Cristina ^a   Vanderpooten, Daniel ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Approximation; fptas; Knapsack; Min max; Min max regret; Minimum spanning tree; Shortest path

Indexed keywords

APPROXIMATION THEORY; DYNAMIC PROGRAMMING; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

KNAPSACKS; MIN MAX REGRETS; MINIMUM SPANNING TREE; SHORTEST PATH;

COMBINATORIAL MATHEMATICS;

EID: 33751422786     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ejor.2006.03.023     Document Type: Article

References (14)

1. Ausiello G., Crescenzi P., Gambosi G., Kann V., Marchetti-Spaccamela A., and Protasi M. Complexity and approximation. Combinatorial Optimization Problems and their Approximability Properties (1999), Springer-Verlag
2. Barahona F., and Pulleyblank R. Exact arborescences, matching and cycles. Discrete Applied Mathematics 16 (1987) 91-99
3. Erlebach T., Kellerer H., and Pferschy U. Approximating multiobjective knapsack problems. Management Science 48 12 (2002) 1603-1612
4. Garey M., and Johnson D. Computers and Intractability: A Guide to the Theory of NP-completeness (1979), Freeman
5. Hochbaum D.S. Approximation Algorithms for NP-hard Problems (1997), PWS Publishing, Boston, MA, USA
6. Hong S.P., Chung S.J., and Park B.H. A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. Operations Research Letters 32 3 (2004) 233-239
7. Karp R.M. Reducibility among combinatorial problems. Complexity of Computer Computations (1972), Plenum Press 85-103
8. Kouvelis P., and Yu G. Robust Discrete Optimization and its Applications (1997), Kluwer Academic Publishers, Boston
9. M. Mahajan, V. Vinay, A combinatorial algorithm for the determinant, in: Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1997), New Orleans, USA, 1997, pp. 730-738.
10. Papadimitriou C.H. Computational Complexity (1994), Addison Wesley
11. C.H. Papadimitriou, M. Yannakakis, On the approximability of trade-offs and optimal access of web sources, in: IEEE Symposium on Foundations of Computer Science (FOCS 2000), Redondo Beach, California, USA, 2000, pp. 86-92.
12. H.M. Safer, J.B. Orlin, Fast approximation schemes for multi-criteria combinatorial optimization. Technical Report 3756-95, Sloan School of Management, 1995.
13. Sahni S. General techniques for combinatorial approximation. Operations Research 25 6 (1977) 920-936
14. Vazirani V.V. Approximation Algorithms (2001), Springer-Verlag