Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack

Lecture Notes in Computer Science

Volumn 3669, Issue , 2005, Pages 862-873

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

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Approximation; Fptas; Knapsack; Mi nimum spanning tree; Min max; Min max regret; Shortest path

Indexed keywords

APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY; DYNAMIC PROGRAMMING; NUMBER THEORY; OPTIMIZATION; POLYNOMIALS; PROBLEM SOLVING;

FPTAS; KNAPSACK; MIN-MAX; MIN-MAX REGRET; MINIMUM SPANNING TREE; SHORTEST PATHS;

GRAPH THEORY;

EID: 27144463454     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/11561071_76     Document Type: Conference Paper

References (8)

1. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and approximation. Combinatorial optimization problems and their approximability properties. Springer, 1999.
2. M. Garey and D. Johnson. Computer and Intractability: A Guide to the theory of NP-completeness. Freeman, 1979.
3. P. Kouvelis and G. Yu. Robust Discrete Optimization and its Applications. Kluwer Academic Publishers, Boston, 1997.
4. M. Mahajan and V. Vinay. Determinants: combinatorics, algorithms, and complexity. In Proceedings of the Eigth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, pages 730-738, New Orleans, USA, 1997.
5. C. H. Papadimitriou and M. Yannakakis. On the approximability of trade-offs and optimal access of web sources. In IEEE Symposium on Foundations of Computer Science, pages 86-92, 2000.
6. S. Sahni. General techniques for combinatorial approximation. Operations Research, 25(6):920-936, 1977.
7. V. V. Vazirani. Approximation Algorithms. Springer, 2001.
8. D. Zuckerman. NP-complete problems have a version that's hard to approximate. In Proceeding 8th Annual Conference on Structure in Complexity Theory, pages 305-312, 1993.