✦ LIBER ✦

Reduction of the Three-Partition Problem

✍ Scribed by Mauro Dell'Amico; Silvano Martello

Book ID: 110282056
Publisher: Springer US
Year: 1999
Tongue: English
Weight: 89 KB
Volume: 3
Category: Article
ISSN: 1382-6905
DOI: 10.1023/a:1009856820553

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Reduction of The Stellar Three – Body Pr

Reduction of The Stellar Three – Body Problem

✍ Nadia A. Saad 📂 Article 📅 2003 🏛 Springer Netherlands 🌐 English ⚖ 90 KB

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

The vectorization of the partition probl

The vectorization of the partition problem

✍ S.J Shyu; R.C.T Lee 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 370 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