✦ LIBER ✦

Non-similarity combinatorial problems

✍ Scribed by Anatoly R. Rubinov; Vadim G. Timkovsky

Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 733 KB
Volume: 30
Category: Article
ISSN: 0303-2647
DOI: 10.1016/0303-2647(93)90064-j

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Similarity solutions to some non-linear

✍ D.B. Taulbee; F.A. Cozzarelli; C.L. Dym 📂 Article 📅 1971 🏛 Elsevier Science 🌐 English ⚖ 765 KB

Self-similar piston problem in non-ideal

✍ Melam P. Ranga Rao; Niranjan K. Purohit 📂 Article 📅 1976 🏛 Elsevier Science 🌐 English ⚖ 377 KB

Some combinatorial problems

✍ J. Akiyama; K. Hosono; M. Urabe 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 473 KB

Combinatorial reconstruction problems

✍ N Alon; Y Caro; I Krasikov; Y Roditty 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 715 KB

ChemInform Abstract: Stochastic Similari

ChemInform Abstract: Stochastic Similarity Selections from Large Combinatorial Libraries.

✍ Victor S. Lobanov; Dimitris K. Agrafiotis 📂 Article 📅 2010 🏛 John Wiley and Sons ⚖ 24 KB 👁 2 views

On simple combinatorial optimization pro

On simple combinatorial optimization problems

✍ A.J. Hoffman 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 228 KB

We characterize (0,l) linear programming matrices for which a greedy algorithm and its dual solve certain covering and packing problems. Special cases are shortest path and minimum spanning tree algorithms.