𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A bound for the number of different basic solutions generated by the simplex method

✍ Scribed by Tomonari Kitahara, Shinji Mizuno

Book ID
118791903
Publisher
Springer-Verlag
Year
2011
Tongue
English
Weight
129 KB
Volume
137
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A better bound for the cop number of gen
A better bound for the cop number of general graphs
✍ Ehsan Chiniforooshan πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 85 KB

## Abstract In this note, we prove that the cop number of any __n__‐vertex graph __G__, denoted by ${{c}}({{G}})$, is at most ${{O}}\big({{{n}}\over {{\rm lg}} {{n}}}\big)$. Meyniel conjectured ${{c}}({{G}})={{O}}(\sqrt{{{n}}})$. It appears that the best previously known sublinear upper‐bound is du