✦ LIBER ✦

The vectorization of the partition problem

✍ Scribed by S.J Shyu; R.C.T Lee

Book ID: 107919260
Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 370 KB
Volume: 16
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(90)90071-g

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Mean-Partition Problem

✍ Fei-Hwang Chang; Frank K. Hwang; Uriel G. Rothblum 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 165 KB

The satisfactory partition problem

✍ Cristina Bazgan; Zsolt Tuza; Daniel Vanderpooten 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 208 KB

The partition bargaining problem

✍ Uriel G. Rothblum; Yoav Tangir 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 236 KB

Reduction of the Three-Partition Problem

✍ Mauro Dell'Amico; Silvano Martello 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 89 KB

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

✍ 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.