𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the complexity of min–max sorting networks

✍ Scribed by Giuseppe Campobello; Giuseppe Patanè; Marco Russo

Book ID
113662296
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
741 KB
Volume
190
Category
Article
ISSN
0020-0255

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

Solving min-max shortest-path problems o
Solving min-max shortest-path problems on a network
✍ Ishwar Murthy; Shenq-Shyong Her 📂 Article 📅 1992 🏛 John Wiley and Sons 🌐 English ⚖ 877 KB

In this article we consider the problem of determining a path between two nodes in a network that minimizes the maximum of r path length values associated with it. This problem has a direct application in scheduling. It also has indirect applications in a class of routing problems and when consideri