✦ LIBER ✦

A problem of restricted partitions

✍ Scribed by V. R. R. Uppuluri; J. A. Carpenter

Publisher: John Wiley and Sons
Year: 1974
Tongue: English
Weight: 186 KB
Volume: 21
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800210115

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Partition Problem

✍ J.W. Sander 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 458 KB

A unidirectional ring partition problem

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

Restricted delivery problems on a networ

Restricted delivery problems on a network

✍ Arkin, Esther M.; Hassin, Refael; Klein, Limor 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB

We consider a delivery problem on a network in which nodes have supplies or demands for certain products and arcs have lengths satisfying the triangle inequality. A vehicle of infinite capacity travels through the network, carrying products to their destinations, and is limited in that it can carry

Solution of a restricted Hadamard proble

Solution of a restricted Hadamard problem on Minkowski spaces

✍ Yuri Yu. Berest 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 281 KB 👁 1 views

We give a complete solution of Hadamard's problem concerning Huygens' principle on evendimensional Minkowski spaces M n+1 for a restricted class of linear, second-order, normal hyperbolic operators L = n+1 +u(x 1 , x 2 ) with real (locally) analytic potentials u = u(x 1 , x 2 ) depending on two spat

Sufficient Partitions for a class of coi

Sufficient Partitions for a class of coin tossing problems

✍ Narayana, T. V. ;Chorneyko, I. ;Sathe, Y. S. 📂 Article 📅 1960 🏛 Wiley (John Wiley & Sons) ⚖ 323 KB

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