✦ LIBER ✦

On a covering problem of Mullin and Stanton for binary matroids

✍ Scribed by James G. Oxley

Book ID: 105490968
Publisher: Springer
Year: 1980
Tongue: English
Weight: 587 KB
Volume: 20
Category: Article
ISSN: 0001-9054
DOI: 10.1007/bf02190499

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a covering problem of Mullin and Stan

On a covering problem of Mullin and Stanton for binary matroids

✍ James G. Oxley 📂 Article 📅 1979 🏛 Springer 🌐 English ⚖ 72 KB

Lawrence Oriented Matroids and a Problem

Lawrence Oriented Matroids and a Problem of McMullen on Projective Equivalences of Polytopes

✍ J.L. Ramı&#x0301;rez Alfonsı&#x0301;n 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 107 KB

Consider the following question introduced by McMullen: Determine the largest integer n = f (d) such that any set of n points in general position in the affine d-space R d can be mapped by a projective transformation onto the vertices of a convex polytope. It is known that 2d + 1 ≤ f (d) < (d + 1)(d

On Upper Bounds for Minimum Distance and

On Upper Bounds for Minimum Distance and Covering Radius of Non-binary Codes

✍ Tero Laihonen; Simon Litsyn 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 329 KB

Duality and Distance Constraints for the

Duality and Distance Constraints for the Nonlinear p-Center Problem and Covering Problem on a Tree Network

✍ B. C. Tansel, R. L. Francis, T. J. Lowe and M. L. Chen 📂 Article 📅 1982 🏛 INFORMS 🌐 English ⚖ 541 KB

A note on ‘Algorithms for connected set

A note on ‘Algorithms for connected set cover problem and fault-tolerant connected set cover problem’

✍ Wei Ren; Qing Zhao 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 229 KB

A dynamic programming algorithm for the

A dynamic programming algorithm for the conditional covering problem on tree graphs

✍ Jennifer A. Horne; J. Cole Smith 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 195 KB 👁 1 views