𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Complexity of Optimal Hotlink Assignment

✍ Scribed by Tobias Jacobs

Publisher
Springer
Year
2011
Tongue
English
Weight
772 KB
Volume
62
Category
Article
ISSN
0178-4617

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The complexity of multiple wordlength as
The complexity of multiple wordlength assignment
✍ G.A. Constantinides; G.J. Woeginger πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 331 KB

This note discusses the multiple wordlength assignment problem for the design of custom digital signal processing (DSP) parallel processors. It is demonstrated that this assignment problem is NP-hard.

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