Vacuum packing preventing the evaporation of volatile components. It is also commonly used to store dry foods over a long period of time, such as cereals, nuts, cured meats, cheese, smoked fish, coffee, and potato chips (crisps). On a more short term basis, vacuum packing can also be used to store fresh foods, such as vegetables, meats, and liquids, because it inhibits bacterial growth. Vacuum packing greatly reduces the bulk of non-food items. For example, clothing and bedding can be stored in bags evacuated with a domestic vacuum cleaner or a dedicated vacuum sealer. This technique is sometimes used to compact household
Packing in a hypergraph improvement. Any Steiner Triple System on "n" vertices contains a packing covering all vertices but at most formula_129. Packing in a hypergraph In mathematics, a packing in a hypergraph is a partition of the set of the hypergraph's edges into a number of disjoint subsets such that no pair of edges in each subset share any vertex. There are two famous algorithms to achieve asymptotically optimal packing in "k"-uniform hypergraphs. One of them is a random greedy algorithm which was proposed by Joel Spencer. He used a branching process to formally prove the optimal achievable bound under some side conditions.