Explicit Constructions of Rödl's Asymptotically Good Packings and Coverings

Authors:
N. N. Kuzjurin
Affiliations:
Institute for System Programming, Russian Academy of Sciences, B. Kommunisticheskaya, 25, 109004 Moscow, Russia (e-mail: nnkuz@ispras.ru)
Venue:
Combinatorics, Probability and Computing
Year:
2000

Citing 9
Cited 0

Probabilistic construction of deterministic algorithms: approximating packing integer programs

Journal of Computer and System Sciences - 27th IEEE Conference on Foundations of Computer Science October 27-29, 1986
Asymptotic behavior of the chromatic index for hypergraphs

Journal of Combinatorial Theory Series A
On the difference between asymptotically good packings and coverings

European Journal of Combinatorics
Randomized algorithms

Randomized algorithms
Asymptotic packing via a branching process

Random Structures & Algorithms
Asymptotic packing and the random greedy algorithm

Random Structures & Algorithms
Asymptotically optimal covering designs

Journal of Combinatorial Theory Series A
Nearly-perfect hypergraph packing is in NC

Information Processing Letters
Splitters and near-optimal derandomization

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

For any fixed l k we present families of asymptotically good packings and coverings of the l-subsets of an n-element set by k-subsets, and an algorithm that, given a natural number i, finds the ith k-subset of the family in time and space polynomial in log n.