✦ LIBER ✦

Simultaneous Packing and Covering in Sequence Spaces

✍ Scribed by Konrad J. Swanepoel

Book ID: 106149962
Publisher: Springer
Year: 2009
Tongue: English
Weight: 242 KB
Volume: 42
Category: Article
ISSN: 0179-5376
DOI: 10.1007/s00454-009-9189-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Simultaneous Packing and Covering in Euc

Simultaneous Packing and Covering in Euclidean Space

✍ Butler, G. J. 📂 Article 📅 1972 🏛 Oxford University Press 🌐 English ⚖ 290 KB

Packing, covering and tiling in two-dime

Packing, covering and tiling in two-dimensional spaces

✍ Zong, Chuanming 📂 Article 📅 2014 🏛 Elsevier Science 🌐 German ⚖ 869 KB

Simultaneous Packing and Covering in the

Simultaneous Packing and Covering in the Euclidean Plane

✍ Chuanming Zong 📂 Article 📅 2002 🏛 Springer Vienna 🌐 English ⚖ 99 KB

Covering and packing in linear space

✍ Andreas Björklund; Thore Husfeldt; Petteri Kaski; Mikko Koivisto 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 133 KB

COVERING AND PACKING IN GRAPHS, I.

✍ Frank Harary 📂 Article 📅 1970 🏛 John Wiley and Sons 🌐 English ⚖ 285 KB

Packing and covering triangles in graphs

✍ P.E. Haxell 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 184 KB

It is shown that if G is a graph such that the maximum size of a set of pairwise edge-disjoint triangles is v(G), then there is a set C of edges of G of size at most (3 -e)v(G) such that E(T) N C 7~ 0 for every triangle T of G, where e> 3. This is the first nontrivial bound known for a long-standing