✦ LIBER ✦

The maximum saving partition problem

✍ Scribed by Refael Hassin; Jérôme Monnot

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 189 KB
Volume: 33
Category: Article
ISSN: 0167-6377
DOI: 10.1016/j.orl.2004.07.007

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Approximation Algorithms for Ma

Improved Approximation Algorithms for Maximum Graph Partitioning Problems

✍ Gerold Jäger; Anand Srivastav 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 289 KB

Saving the World - Maximum Ride 3

✍ Patterson, James 📂 Fiction 📅 2007 🏛 Little, Brown Books for Young Readers 🌐 English ⚖ 149 KB

The Mean-Partition Problem

✍ Fei-Hwang Chang; Frank K. Hwang; Uriel G. Rothblum 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 165 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.

The SONET edge-partition problem

✍ Olivier Goldschmidt; Dorit S. Hochbaum; Asaf Levin; Eli V. Olinick 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB