✦ LIBER ✦

The SONET edge-partition problem

✍ Scribed by Olivier Goldschmidt; Dorit S. Hochbaum; Asaf Levin; Eli V. Olinick

Publisher: John Wiley and Sons
Year: 2002
Tongue: English
Weight: 165 KB
Volume: 41
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.10054

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Partition Problem

✍ J.W. Sander 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 458 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.

A unidirectional ring partition problem

✍ Jyun-Jy Hu; Shi-Nine Yang; Maw-Sheng Chern 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 468 KB

A polynomial time approximation scheme f

A polynomial time approximation scheme for the SONET ring loading problem

✍ Sanjeev Khanna 📂 Article 📅 2002 🏛 Institute of Electrical and Electronics Engineers 🌐 English ⚖ 110 KB 👁 1 views

A note on the bottleneck graph partition

A note on the bottleneck graph partition problem

✍ Klinz, Bettina; Woeginger, Gerhard J. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 47 KB 👁 2 views

The bottleneck graph partition problem consists of partitioning the vertices of an undirected edge-weighted graph into two equally sized sets such that the maximum edge weight in the cut separating the two sets becomes minimum. In this short note, we present an optimum algorithm for this problem wit