Randomized Post-optimization for t-Restrictions

DOI10.1007/978-3-642-36899-8_30MaRDI QIDQ4915260zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn, Peyman Nayeri

Publication date 9 April 2013

Published in Information Theory, Combinatorics, and Search Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-36899-8_30

zbMATH Keywords

covering arraydisjunct matrixframeproof codehash family

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Communication, information (94A99) Other types of codes (94B60) Theory of error-correcting codes and error-detecting codes (94B99)

Recommendations

• Randomized postoptimization of covering arrays
• Randomized post-optimization of covering arrays
• Optimization, randomized approximability, and Boolean constraint satisfaction problems
• Randomized approximation of the constraint satisfaction problem
• scientific article; zbMATH DE number 1002207
• scientific article; zbMATH DE number 2077129
• Randomized methods for linear constraints: convergence rates and conditioning
• scientific article; zbMATH DE number 1775049
• Random restricted matching and lower bounds for combinatorial optimization
• Constrained optimization of the randomized iterative method

Cites work

• Algorithmic construction of sets for k -restrictions
• Constructing Perfect Hash Families Using a Greedy Algorithm
• Covering arrays and hash families
• Distributing hash families and covering arrays
• Explicit constructions of separating hash families from algebraic curves over finite fields
• scientific article; zbMATH DE number 823957 (Why is no real title available?)
• Introduction to algorithms.
• Perfect Hash Families: Constructions and Existence
• Randomized post-optimization of covering arrays
• Randomized postoptimization of covering arrays
• Secure frameproof codes, key distribution patterns, group testing algorithms and related structures
• Some Improved Bounds for Secure Frameproof Codes and Related Separating Hash Families
• Strengthening hash families and compressive sensing
• Threshold and Majority Group Testing

Cited in

(3)

• Sequence Covering Arrays and Linear Extensions
• Detecting arrays for effects of single factors
• A note on the \(k\)-restriction problem

This page was built for publication: Randomized Post-optimization for t-Restrictions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4915260)