✦ LIBER ✦

Problem in combinatorial analysis

✍ Scribed by S. S. Kisiitsyn

Publisher: SP MAIK Nauka/Interperiodica
Year: 1968
Tongue: English
Weight: 194 KB
Volume: 3
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01386957

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Arithmetic problems of combinatorial ana

Arithmetic problems of combinatorial analysis

✍ A. I. Pavlov 📂 Article 📅 1994 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 236 KB

Domination analysis of combinatorial opt

Domination analysis of combinatorial optimization problems

✍ Gregory Gutin; Alek Vainshtein; Anders Yeo 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 141 KB

We use the notion of domination ratio introduced by Glover and Punnen in 1997 to present a new classiÿcation of combinatorial optimization (CO) problems: DOM-easy and DOM-hard problems. It follows from results already proved in the 1970s that min TSP (both symmetric and asymmetric versions) is DOM-e

Guest editorial: Combinatorial problems

Guest editorial: Combinatorial problems and algorithms in image analysis

📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 36 KB 👁 1 views

Problems and results in combinatorial an

Problems and results in combinatorial analysis and graph theory

✍ Paul Erd'́os 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 764 KB

I wrote many papers with this and similar titles. In my lecture I stated several of my old solved and unsolved problems some of which have already been published elsewhere. To avoid overlap as much as possible, I state here only relatively new problems. First I state two recent problems of Nesetril

A combinatorial problem in pharmacology

✍ George H. Weiss; John Rice 📂 Article 📅 1982 🏛 Springer 🌐 English ⚖ 301 KB

A combinatorial problem

✍ J. A. Thas 📂 Article 📅 1973 🏛 Springer 🌐 English ⚖ 177 KB