Complexity of the min-max (regret) versions of cut problems

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

Volumn 3827 LNCS, Issue , 2005, Pages 789-798

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

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

Complexity; Min cut; Min max; Min max regret; s t min cut

Indexed keywords

COMPUTATIONAL METHODS; POLYNOMIALS; PROBLEM SOLVING;

COMPLEXITY; MIN CUT; MIN-MAX; MIN-MAX REGRET; S - T MIN CUT;

COMPUTATIONAL COMPLEXITY;

EID: 33744960058     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11602613_79     Document Type: Conference Paper

References (9)

1. 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, 2005. to appear.
2. H. Aissi, C. Bazgan, and D. Vanderpooten. Complexity of the min-max and minmax regret assignment problem. Operations Research Letters, 33:634-640, 2005.
3. A. Armon and U. Zwick. Multicriteria global minimum cuts. In Proceedings of the 15th International Symposium on Algorithms and Complexity (ISAAC 2004), Hong Kong, China, LNCS 3341, pages 65-76. Springer-Verlag, 2004.
4. I. D. Aron and P. Van Hentenryck. On the complexity of the robust spanning tree with interval data. Operations Research Letters, 32:36-40, 2004.
5. I. Averbakh and V. Lebedev. Interval data min-max regret network optimization problems. Discrete Applied Mathematics, 138:289-301, 2004.
6. M. Garey and D. Johnson. Computers and intractability: a guide to the theory of NP-completeness. Freeman, San Francisco, 1979.
7. P. Kouvelis and G. Yu. Robust Discrete Optimization and its Applications. Kluwer Academic Publishers, Boston, 1997.
8. H. Nagamochi, K. Nishimura, and T. Ibaraki. Computing all small cuts in an undirected network. SIAM Journal on Discrete Mathematics, 10(3):469-481, 1997.
9. H. Yaman, O. E. Karaşan, and M. C. Pinar. The robust spanning tree problem with interval data. Operations Research Letters, 29:31-40, 2001.