𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Mean-Partition Problem

✍ Scribed by Fei-Hwang Chang; Frank K. Hwang; Uriel G. Rothblum

Publisher
Springer US
Year
2006
Tongue
English
Weight
165 KB
Volume
36
Category
Article
ISSN
0925-5001

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Partition Problem
A Partition Problem
✍ J.W. Sander πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 458 KB
The bottleneck graph partition problem
The bottleneck graph partition problem
✍ Hochbaum, Dorit S.; Pathria, Anu πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 401 KB πŸ‘ 2 views

The bottleneck graph partition problem is to partition the nodes of a graph into two equally sized sets, so that the maximum edge weight in the cut separating the two sets is minimum. Whereas the graph partition problem, where the sum of the edge weights in the cut is to be minimized, is NP-hard, th

The Knowlton–Graham Partition Problem
The Knowlton–Graham Partition Problem
✍ Donald E. Knuth πŸ“‚ Article πŸ“… 1996 πŸ› Elsevier Science 🌐 English βš– 232 KB

A set partition technique that is useful for identifying wires in cables can be recast in the language of 0 1 matrices, thereby resolving an open problem stated by R. L. Graham in Volume 1 of this journal. The proof involves a construction of 0 1 matrices having row and column sums without gaps.

The SONET edge-partition problem
The SONET edge-partition problem
✍ Olivier Goldschmidt; Dorit S. Hochbaum; Asaf Levin; Eli V. Olinick πŸ“‚ Article πŸ“… 2002 πŸ› John Wiley and Sons 🌐 English βš– 165 KB
The maximum saving partition problem
The maximum saving partition problem
✍ Refael Hassin; JΓ©rΓ΄me Monnot πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 189 KB