Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Algorithmic Construction of Sets for k-Restrictions Dana Moshkovitz
 

Summary: Algorithmic Construction of Sets for k-Restrictions
Noga Alon
Dana Moshkovitz
Shmuel Safra
Abstract
This work addresses k-restriction problems, which unify combinatorial problems of the
following type: The goal is to construct a short list of strings in m
that satisfies a given
set of k-wise demands. For every k positions and every demand, there must be at least
one string in the list that satisfies the demand at these positions. Problems of this form
frequently arise in different fields in Computer Science.
The standard approach for deterministically solving such problems is via almost k-wise
independence or k-wise approximations for other distributions. We offer a generic algo-
rithmic method that yields considerably smaller constructions. To this end, we generalize
a previous work of Naor, Schulman and Srinivasan [18]. Among other results, we greatly
enhance the combinatorial objects in the heart of their method, called splitters, and con-
struct multi-way splitters, using a new discrete version of the topological Necklace Splitting
Theorem [1].
We utilize our methods to show improved constructions for group testing [19] and gen-
eralized hashing [3], and an improved inapproximability result for Set-Cover under the

  

Source: Alon, Noga - School of Mathematical Sciences, Tel Aviv University

 

Collections: Mathematics