Cited in
(10)- A balancing strategy
- Probabilistic methods
- Probabilistic construction of deterministic algorithms: approximating packing integer programs
- ``Integer-making theorems
- Discrete ham sandwich theorems
- Balancing families of integer sequences
- Signed domination in regular graphs and set-systems
- The probabilistic method yields deterministic parallel algorithms
- Six Standard Deviations Suffice
- Multiterminal global routing: A deterministic approximation scheme
This page was built for publication: Balancing families of sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1250818)