Approximating min-max (regret) versions of some polynomial problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4112 LNCS, Issue , 2006, Pages 428-438

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

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Approximation; Fptas; Min max; Min max regret; Minimum spanning tree; Shortest path

Indexed keywords

APPROXIMATION THEORY; POLYNOMIALS; PROBLEM SOLVING; TREES (MATHEMATICS);

MINIMUM SPANNING TREE; SHORTEST PATH;

OPERATIONS RESEARCH;

EID: 33749564542     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11809678_45     Document Type: Conference Paper

References (11)

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullmann. The design and analysis of computer algorithms. Addison-Wesley Reading, 1976.
2. H. Aissi, C. Bazgan, and D. Vanderpooten. Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack. In Proceedings of the 13th Annual European Symposium on Algorithms (ESA 2005), Mallorca, Spain, LNCS 3669, pages 862-873, 2005.
3. F. Barahona and R. Pulleyblank. Exact arborescences, matching and cycles. Discrete Applied Mathematics, 16:91-99, 1987.
4. J. Edmonds. System of distinct representatives and linear algebra. Journal of Research of the National Bureau of Standards, 71:241-245, 1967.
5. S. P. Hong, S. J. Chung, and B. H. Park. A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. Operations Research Letters, 32(3):233-239, 2004.
6. P. Kouvelis and G. Yu. Robust discrete optimization and its applications. Kluwer Academic Publishers, Boston, 1997.
7. M. Mahajan and 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, pages 730-738, 1997.
8. C. H. Papadimitriou. Computational complexity. Addison Wesley, 1994.
9. 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 (FOGS 2000), Redondo Beach, California, USA, pages 86-92, 2000.
10. W.T. Tutte. Graph Theory, volume 21 of Encyclopedia of Mathematics and its Applications. Addison-Wesley, 1984.
11. A. Warburton. Approximation of Pareto optima in multiple-objective, shortest-path problems. Operations Research, 35:70-79, 1987.