Cardoso; Nuno; Abreu; Rui ( The Set-Covering Problem)

From Algorithm Wiki

Jump to navigation Jump to search

Time Complexity

$O(n^{2})$

Space Complexity

()

Description

Approximate?

Exact

Randomized?

No, deterministic

Model of Computation

Year

2014

Reference

https://www.semanticscholar.org/paper/An-efficient-distributed-algorithm-for-computing-Cardoso-Abreu/ce32696c1176800c5b90fab026bf93f282e2b161

Retrieved from "https://algorithm-wiki.csail.mit.edu/w/index.php?title=Cardoso;_Nuno;_Abreu;_Rui_(_The_Set-Covering_Problem)&oldid=44958"