✦ LIBER ✦

A note on Lerda and Majorani's minimum crossing algorithm

✍ Scribed by F. Rubin

Book ID: 110562114
Publisher: Springer Milan
Year: 1974
Tongue: English
Weight: 91 KB
Volume: 11
Category: Article
ISSN: 0008-0624
DOI: 10.1007/bf02575825

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Note on Weintraub’s Minimum-Cost Circula

Note on Weintraub’s Minimum-Cost Circulation Algorithm

✍ Barahona, Francisco; Tardos, éva 📂 Article 📅 1989 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 626 KB

A note on Khilnani and TSE's USA algorit

A note on Khilnani and TSE's USA algorithm

✍ Patrice Marcotte 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 146 KB

We present a modification of algorithm USA of Khilnani and Tse which is guaranteed to converge to the unique equilibrium solution from an arbitrary starting point.

A note on the Frank—Tardos bi-truncation

A note on the Frank—Tardos bi-truncation algorithm for crossing-submodular functions

✍ Takeshi Naitoh; Satoru Fujishige 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 113 KB

A note on minimum aberration and clear c

A note on minimum aberration and clear criteria

✍ Peng-Fei Li; Bao-Jiang Chen; Min-Qian Liu; Run-Chu Zhang 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 118 KB

A note on bisecting minimum spanning tre

A note on bisecting minimum spanning trees

✍ W. M. Boyce; M. R. Garey; D. S. Johnson 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 281 KB

A note on minimum cost convex flows

✍ D. L. Adolphson 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 92 KB