✦ LIBER ✦

On the length of simplex paths: The assignment case

✍ Scribed by P. O. Lindberg; Snjólfur Ólafsson

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the average length of lexicographic p

✍ M. L. Balinski; Th. M. Liebling; A. -E. Nobs 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 118 KB

Dissection of the path-simplex in into n

✍ Jan Brandts; Sergey Korotov; Michal Křížek 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 357 KB

Lower bounds on the length of monotone p

✍ Jiří Matoušek 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 262 KB

Bounds on the weighted path length of bi

✍ J. Nievergelt; J. Pradels; C.K. Wong; P.C. Yue 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 708 KB

A note on the path length of red–black t

✍ Helen Cameron; Derick Wood 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 443 KB

On the complexity of vertex-disjoint len

✍ Andreas Bley 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 277 KB