A greedy algorithm to construct covering arrays using a graph representation
DOI10.1016/J.INS.2018.10.048zbMATH Open1442.68186OpenAlexW2898691066WikidataQ129015606 ScholiaQ129015606MaRDI QIDQ2201668FDOQ2201668
Jose Carlos Perez-Torres, Jose Torres-Jimenez
Publication date: 29 September 2020
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2018.10.048
Recommendations
- Covering arrays on graphs
- A greedy-metaheuristic 3-stage approach to construct covering arrays
- Covering analysis of the greedy algorithm for partial cover
- A survey of methods for constructing covering arrays
- An approximation algorithm for the total covering problem
- Publication:4484774
- A Tight Analysis of the Greedy Algorithm for Set Cover
- Problems and algorithms for covering arrays via set covers
- scientific article; zbMATH DE number 3894490
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- An improved branch and bound algorithm for the maximum clique problem
- Products of mixed covering arrays of strength two
- Orthogonal Arrays of Index Unity
- Two applications (for search theory and truth functions) of Sperner type theorems
- Families of \(k\)-independent sets
- A fast algorithm for the maximum clique problem
- An exact bit-parallel algorithm for the maximum clique problem
- A review on algorithms for maximum clique problems
- An exact algorithm for the maximum clique problem
- Title not available (Why is that?)
- Software and hardware testing using combinatorial covering suites
- Upper bounds for covering arrays by tabu search.
- Covering arrays from cyclotomy
- A survey of combinatorial testing
- Constraint models for the covering test problem
- Exhaustive Test Pattern Generation with Constant Weight Vectors
- Tower of covering arrays
- Construction of non-isomorphic covering arrays
Cited In (1)
Uses Software
This page was built for publication: A greedy algorithm to construct covering arrays using a graph representation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2201668)
