Pages that link to "Item:Q4373370"

The following pages link to New constructions for covering designs (Q4373370):

Displaying 23 items.

• A tabu search algorithm for the covering design problem (Q415558) (← links)
• Uncoverings-by-bases for base-transitive permutation groups. (Q851785) (← links)
• The minimum likely column cover problem (Q1029075) (← links)
• Error-correcting codes from permutation groups (Q1043942) (← links)
• General upper bounds on the minimum size of covering designs (Q1291117) (← links)
• Connected coverings and an application to oriented matroids (Q1584290) (← links)
• Some \(t\)-designs are minimal \((t+1)\)-coverings (Q1584345) (← links)
• An effective greedy heuristic for the social golfer problem (Q1761919) (← links)
• Optimal covering designs: complexity results and new bounds (Q1765237) (← links)
• What we know and what we do not know about Turán numbers (Q1895823) (← links)
• Renaming and the weakest family of failure detectors (Q1938384) (← links)
• Optimal partial clique edge covering guided by potential energy minimization (Q2329666) (← links)
• Comparative analysis of topological constructions of sparse flat neighborhood networks for cluster supercomputers (Q2571526) (← links)
• Variable neighborhood descent heuristic for covering design problem (Q2840773) (← links)
• Generalized covering designs and clique coverings (Q3100732) (← links)
• Upper bounds on the general covering number<i>C</i>_λ(<i>v</i>,<i>k</i>,<i>t</i>,<i>m</i>) (Q3156929) (← links)
• Constraint Orbital Branching (Q3503850) (← links)
• New coverings oft-sets with (t + 1)-sets (Q4242743) (← links)
• On asymmetric coverings and covering numbers (Q4808412) (← links)
• Asymptotic Bounds for General Covering Designs (Q5175786) (← links)
• Connected Covering Numbers (Q5744163) (← links)
• Towards a Theory of Intrusion Detection (Q5862669) (← links)
• New lower bounds for \(t\)-coverings (Q6573098) (← links)