𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten

Book ID
108114375
Publisher
Elsevier Science
Year
2008
Tongue
English
Weight
254 KB
Volume
5
Category
Article
ISSN
1572-5286

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Complexity of the min–max and min–max re
Complexity of the min–max and min–max regret assignment problems
✍ Hassene Aissi; Cristina Bazgan; Daniel Vanderpooten 📂 Article 📅 2005 🏛 Elsevier Science 🌐 English ⚖ 179 KB

This paper investigates the complexity of the min-max and min-max regret assignment problems both in the discrete scenario and interval data cases. We show that these problems are strongly NP-hard for an unbounded number of scenarios. We also show that the interval data min-max regret assignment pro