𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The bounds of min-max pair heap construction

✍ Scribed by R.A. Chowdhury; M.Z. Rahman; M. Kaykobad

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
372 KB
Volume
43
Category
Article
ISSN
0898-1221

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

The structure of max–min hyperplanes
The structure of max–min hyperplanes
✍ V. Nitica πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 485 KB

In this article, continuing [12,13], further contributions to the theory of max-min convex geometry are given. The max-min semiring is the set R = R βˆͺ {±∞} endowed with the operations βŠ• = max, βŠ— = min in R. A max-min hyperplane (briefly, a hyperplane) is the set of all points x = (x 1 , . . . , x n