An efficient distributed algorithm for computing minimal hitting sets
Computing minimal hitting sets for a collection of sets is an important problem in many domains (e.g., Spectrum-based Fault Localization). Being an NP-Hard problem, exhaustive algorithms are usually prohibitive for real-world, often large, problems. In practice, the usage of heuristic based approach...
| Autor principal: | |
|---|---|
| Outros Autores: | |
| Formato: | conferencePaper |
| Idioma: | eng |
| Publicado em: |
2014
|
| Texto completo: | http://hdl.handle.net/1822/37953 |
| País: | Portugal |
| Oai: | oai:repositorium.sdum.uminho.pt:1822/37953 |