Handbook of theoretical computer science (vol. A)
Small-bias probability spaces: efficient constructions and applications
SIAM Journal on Computing
Constructing small sample spaces satisfying given constraints
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Journal of the ACM (JACM)
A tight analysis of the greedy algorithm for set cover
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Efficient approximation of product distributions
Random Structures & Algorithms
PCP characterizations of NP: towards a polynomially-small error-probability
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
Improved Approximation Guarantees for Packing and Covering Integer Programs
SIAM Journal on Computing
Splitters and near-optimal derandomization
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Generalized hashing and parent-identifying codes
Journal of Combinatorial Theory Series A
European Journal of Combinatorics - Special issue on extremal and probabilistic combinatorics
A note on systems with max--min and max-product constraints
Fuzzy Sets and Systems
Efficient sensor network design for continuous monitoring of moving objects
Theoretical Computer Science
Approximate min--max theorems for Steiner rooted-orientations of graphs and hypergraphs
Journal of Combinatorial Theory Series B
Packing and Covering δ-Hyperbolic Spaces by Balls
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
A Θ( logn)-approximation for the set cover problem with set ownership
Information Processing Letters
On the Approximability of Combinatorial Exchange Problems
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
On the approximability of the Maximum Agreement SubTree and Maximum Compatible Tree problems
Discrete Applied Mathematics
Solving SAT for CNF Formulas with a One-Sided Restriction on Variable Occurrences
SAT '09 Proceedings of the 12th International Conference on Theory and Applications of Satisfiability Testing
COCOON '09 Proceedings of the 15th Annual International Conference on Computing and Combinatorics
Non-cooperative facility location and covering games
Theoretical Computer Science
Proceedings of the 19th international conference on World wide web
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
New results on optimizing rooted triplets consistency
Discrete Applied Mathematics
Efficient sensor network design for continuous monitoring of moving objects
ALGOSENSORS'07 Proceedings of the 3rd international conference on Algorithmic aspects of wireless sensor networks
Balanced families of perfect hash functions and their applications
ACM Transactions on Algorithms (TALG)
Approximability and inapproximability of the minimum certificate dispersal problem
Theoretical Computer Science
Efficiently decodable non-adaptive group testing
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Information Processing Letters
Minimizing the maximum duty for connectivity in multi-interface networks
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Approximating minimum reset sequences
CIAA'10 Proceedings of the 15th international conference on Implementation and application of automata
Video distribution under multiple constraints
Theoretical Computer Science
Upgrading shortest paths in networks
CPAIOR'11 Proceedings of the 8th international conference on Integration of AI and OR techniques in constraint programming for combinatorial optimization problems
Minimum interval cover and its application to genome sequencing
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
On the complexity of the l-diversity problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
On the approximation ability of evolutionary optimization with application to minimum set cover
Artificial Intelligence
Annals of Mathematics and Artificial Intelligence
The complexity of minimum convex coloring
Discrete Applied Mathematics
Removing local extrema from imprecise terrains
Computational Geometry: Theory and Applications
Computing solutions of the paintshop-necklace problem
Computers and Operations Research
Lossy stochastic game abstraction with bounds
Proceedings of the 13th ACM Conference on Electronic Commerce
An energy-efficient link quality monitoring scheme for wireless networks
Wireless Communications & Mobile Computing
Balanced families of perfect hash functions and their applications
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Fast vertex guarding for polygons with and without holes
Computational Geometry: Theory and Applications
PTAS for the minimum weighted dominating set in growth bounded graphs
Journal of Global Optimization
Differentially private data analysis of social networks via restricted sensitivity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Using feature model knowledge to speed up the generation of covering arrays
Proceedings of the Seventh International Workshop on Variability Modelling of Software-intensive Systems
A randomised approximation algorithm for the partial vertex cover problem in hypergraphs
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
On the approximability and exact algorithms for vector domination and related problems in graphs
Discrete Applied Mathematics
Optimizing password composition policies
Proceedings of the fourteenth ACM conference on Electronic commerce
Testers and their applications
Proceedings of the 5th conference on Innovations in theoretical computer science
Randomized post-optimization for t-restrictions
Information Theory, Combinatorics, and Search Theory
The l-Diversity problem: Tractability and approximability
Theoretical Computer Science
Hi-index | 0.01 |
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 algorithmic method that yields considerably smaller constructions. To this end, we generalize a previous work of Naor et al. [1995]. Among other results, we enhance the combinatorial objects in the heart of their method, called splitters, and construct multi-way splitters, using a new discrete version of the topological Necklace Splitting Theorem [Alon 1987].We utilize our methods to show improved constructions for group testing [Ngo and Du 2000] and generalized hashing [Alon et al. 2003], and an improved inapproximability result for SET-COVER under the assumption P &neq; NP.