User contributions for Admin
Jump to navigation
Jump to search
15 February 2023
- 10:5410:54, 15 February 2023 diff hist +387 N Method of Four Russians (Boolean Matrix Multiplication (Combinatorial) Matrix Product) Created page with "== Time Complexity == $O(n^{3}/(log n)$^{2}) == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1970 == Reference == https://scholar.google.com/scholar?hl=en&as_sdt=0%2C22&q=On+economical+construction+of+the+transitive+closure+of+an+oriented+graph.&btnG=" current
- 10:5410:54, 15 February 2023 diff hist +269 N O'Neil 1973 (Boolean Matrix Multiplication Matrix Product) Created page with "== Time Complexity == $O(n^{3})$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1973 == Reference == https://core.ac.uk/download/pdf/82467126.pdf" current
- 10:5410:54, 15 February 2023 diff hist +308 N (Boolean Matrix Multiplication (Combinatorial) Matrix Product) Created page with "== Time Complexity == $O(n^{3} / log^{2.25} n)$ == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2018 == Reference == https://dl.acm.org/doi/pdf/10.1145/3186893, Theorem 1.4" current
- 10:5410:54, 15 February 2023 diff hist +315 N Output-Sensitive Quantum BMM (Boolean Matrix Multiplication Matrix Product) Created page with "== Time Complexity == O*( \min \{n^{1/3} L^{17/{3}0}, n^{1.5} L^{1/4}\}) == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == Yes, == Model of Computation == Quantum == Year == 2018 == Reference == https://dl.acm.org/doi/pdf/10.1145/3186893, Theorem 1.6" current
- 10:5410:54, 15 February 2023 diff hist +298 N Cygan, Gabow, Sankowski (Bounded integer weights Graph Diameter) Created page with "== Time Complexity == $O(M*V^omega*polylog(M, V)$) == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2012 == Reference == https://dl.acm.org/doi/abs/10.1145/2736283" current
- 10:5310:53, 15 February 2023 diff hist +514 N Ausiello et al. (Maximum Cut, Approximate Maximum Cut) Created page with "== Time Complexity == $O(V^{3} logE)$ == Space Complexity == $O(V^{2})$? words (Each vertex keeps track of O(V)-sized vector. assuming this is the goemans-williamson algorithm) == Description == == Approximate? == Approximate Approximation Factor: ~0.878; assuming this is the goemans-williamson algorithm == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2003 == Reference == https://link.springer.com/content/pdf/1..."
- 10:5310:53, 15 February 2023 diff hist +494 N Khuller; Raghavachari & Young, "Greedy Methods" (Maximum Cut, Approximate Maximum Cut) Created page with "== Time Complexity == $O(V^{2})$? == Space Complexity == $O(V)$ auxiliary words (Keeps track of current coloring/assignment) == Description == == Approximate? == Approximate Approximation Factor: 0.5 == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2007 == Reference == https://doc.lagout.org/science/0_Computer%20Science/2_Algorithms/Handbook%20of%20Approximation%20Algorithms%20and%20Metaheuristics%20%5BGonzalez%..."
- 10:5310:53, 15 February 2023 diff hist +366 N Mitzenmacher & Upfal (Maximum Cut, Approximate Maximum Cut) Created page with "== Time Complexity == $O(VE)$? == Space Complexity == $O(V)$ auxiliary words (Keeps track of current coloring/assignment) == Description == == Approximate? == Approximate Approximation Factor: 0.5 == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2005 == Reference == http://lib.ysu.am/open_books/413311.pdf"
- 10:5310:53, 15 February 2023 diff hist +422 N Motwani & Raghavan (Maximum Cut, Approximate Maximum Cut) Created page with "== Time Complexity == $O(V)$? == Space Complexity == $O(V)$ auxiliary words (Keeps track of current coloring/random assignment) == Description == == Approximate? == Approximate Approximation Factor: 0.5 == Randomized? == Yes, Monte Carlo == Model of Computation == Word RAM == Year == 1995 == Reference == https://rajsain.files.wordpress.com/2013/11/randomized-algorithms-motwani-and-raghavan.pdf"
- 10:5310:53, 15 February 2023 diff hist +235 N Hadlock (Maximum Cut Maximum Cut) Created page with "== Time Complexity == $O({2}^V)$ == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1975 == Reference =="
- 10:5310:53, 15 February 2023 diff hist +489 N Iterative naive (d-Neighborhood of a String d-Neighborhood of a String) Created page with "== Time Complexity == $O(f_{bin}(sigma-{1}, n, d)$) where f_{bin}(x, y, z) = sum_{i=0}^z C(y, i)*x^i == Space Complexity == $O(n)$ auxiliary words (Keep track of which indices the differing letters are on, along with which set of letters are replacing the letters in these indices) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference == http://rosalind.info/..."
- 10:5310:53, 15 February 2023 diff hist +438 N MATSF (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$? (per node) words (Each node needs to keep track of O(1) information about itself, and O(1) information per neighbor for synchronization purposes) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM (per node) == Year == 2004 == Reference == https://ieeexplore.ieee.org/document/4359404" current
- 10:5310:53, 15 February 2023 diff hist +515 N Clock-sampling mutual network synchronization (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$? (per node) words (Only needs to keep track of multiplicative correction $s$, its own clocks, and possibly O(1) other info) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM (per node) == Year == 2007 == Reference == https://www.researchgate.net/publication/224306349_Clock-Sampling_Mutual_Network_Synchronization_for_M..." current
- 10:5310:53, 15 February 2023 diff hist +437 N ASP (Clock Synchronization in Distributed Systems Clock Synchronization in Distributed Systems) Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$ (per node) words (Each node needs to keep track of O(1) information about itself, and O(1) information per neighbor for synchronization purposes) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM (per node) == Year == 2005 == Reference == https://ieeexplore.ieee.org/document/1281624" current
- 10:5310:53, 15 February 2023 diff hist +331 N Nordbeck and Rystedt (Orientation) (Point-in-Polygon Point-in-Polygon) Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ words (Only need to keep track of current side being looked at) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1967 == Reference == https://doi.org/10.1007/BF01934125" current
- 10:5310:53, 15 February 2023 diff hist +352 N Preparata and Shamos (Intersection sum of angle) (Point-in-Polygon Point-in-Polygon) Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ words (Only need to keep track of current angle and cumulative angle sum) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1985 == Reference == http://www.cs.kent.edu/~dragan/CG/CG-Book.pdf" current
- 10:5310:53, 15 February 2023 diff hist +343 N Saalfeld (Sign of offset) (Point-in-Polygon Point-in-Polygon) Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ words (Only need to keep track of current sides (2) being looked at) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1987 == Reference == https://doi.org/10.1080/02693798708927823" current
- 10:5310:53, 15 February 2023 diff hist +349 N Preparata and Shamos (Wedge) (Point-in-Polygon Point-in-Polygon) Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$ words (https://ir.nctu.edu.tw/bitstream/11536/749/1/A1997WM15100010.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1985 == Reference == http://www.cs.kent.edu/~dragan/CG/CG-Book.pdf" current
- 10:5310:53, 15 February 2023 diff hist +338 N Nordbeck and Rystedt (Sum of area) (Point-in-Polygon Point-in-Polygon) Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ words (Only need to keep track of current triangle and total area sum) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1967 == Reference == https://doi.org/10.1007/BF01934125" current
- 10:5310:53, 15 February 2023 diff hist +356 N Salomon (Swath Method) (Point-in-Polygon Point-in-Polygon) Created page with "== Time Complexity == $O(nlogn)$ == Space Complexity == $O(n^{2})$ words (https://ir.nctu.edu.tw/bitstream/11536/749/1/A1997WM15100010.pdf) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1978 == Reference == https://doi.org/10.1016/0098-3004(78)90085-7"
- 10:5310:53, 15 February 2023 diff hist +380 N Ray casting algorithm Shimrat; M (Point-in-Polygon Point-in-Polygon) Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O({1})$ words (Only need to keep track of ray direction and how many polygon sides intersect with the ray) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1962 == Reference == https://dl.acm.org/doi/pdf/10.1145/368637.368653" current
- 10:5310:53, 15 February 2023 diff hist +392 N Nordbeck and Rystedt (Grid Method) (Point-in-Polygon Point-in-Polygon) Created page with "== Time Complexity == $O(a)$ == Space Complexity == $O({1})$ words (Only need to keep track of the current grid square being checked (assuming the set of squares is given in the input)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Real RAM == Year == 1967 == Reference == https://doi.org/10.1007/BF01934125"
- 10:5310:53, 15 February 2023 diff hist +400 N Branch and bound (Cyclic Peptide Sequencing Problem Cyclic Peptide Sequencing Problem) Created page with "== Time Complexity == ${2}^{O(n)}$ == Space Complexity == $O({2}^{O(n)})$? words (Keeps track of all possible not fully expanded amino acid sequences so far) == Description == Improvement on brute force (despite not doing better asymptotically) == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1993 == Reference =="
- 10:5310:53, 15 February 2023 diff hist +305 N Brute force (Cyclic Peptide Sequencing Problem Cyclic Peptide Sequencing Problem) Created page with "== Time Complexity == ${2}^{O(n)}$ == Space Complexity == $O(n)$? words (Keeps track of current amino acid sequence being checked) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word/Real RAM == Year == 1987 == Reference =="
- 10:5310:53, 15 February 2023 diff hist +292 N Tushar Deepak Chandra and Sam Toueg (Distributed Locking Algorithms Distributed Locking Algorithms) Created page with "== Time Complexity == $O(n)$ == Space Complexity == () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1996 == Reference == https://www.cs.utexas.edu/~lorenzo/corsi/cs380d/papers/p225-chandra.pdf" current
- 10:5310:53, 15 February 2023 diff hist +361 N Leases (Cary G Gray and David R Cheriton) (Distributed Locking Algorithms Distributed Locking Algorithms) Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(f)$? words (Generally need to keep track of one lease/lock per file (exclusivity)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 1989 == Reference == https://web.stanford.edu/class/cs240/readings/89-leases.pdf" current
- 10:5310:53, 15 February 2023 diff hist +342 N Chubby (Mike Burrows) (Distributed Locking Algorithms Distributed Locking Algorithms) Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(f)$? words (Generally need to keep track of one lock per file (exclusivity)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == == Year == 2006 == Reference == https://dl.acm.org/doi/10.5555/1298455.1298487" current
- 10:5310:53, 15 February 2023 diff hist +375 N Achlioptas (Link Analysis Link Analysis) Created page with "== Time Complexity == $O(mn )$ == Space Complexity == $O((n+l)$^{2})? words (Computes a constant number of SVDs of O((n+l)^2)-sized matrices) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2001 == Reference == https://homes.cs.washington.edu/~karlin/papers/web-search.pdf" current
- 10:5310:53, 15 February 2023 diff hist +465 N Tomlin (Link Analysis Link Analysis) Created page with "== Time Complexity == $O(m n )$ == Space Complexity == $O(n)$? words (Generally computes O(n) values per iteration (row + column sums and their ratios); algorithm can be smart about intermediate calculations as to not use more space asymptotically) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2003 == Reference == https://dl.acm.org/doi/10.1145/775152.775202" current
- 10:5310:53, 15 February 2023 diff hist +381 N Richardson and Domingos (Link Analysis Link Analysis) Created page with "== Time Complexity == $O(m n )$ == Space Complexity == $O(nl)$ words (See paper (noting that sum d_q can be as high as O(nl))) == Description == Query-dependent PageRank == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2002 == Reference == https://homes.cs.washington.edu/~pedrod/papers/nips01b.pdf" current
- 10:5310:53, 15 February 2023 diff hist +400 N Jeh and Widom (Link Analysis Link Analysis) Created page with "== Time Complexity == $O(m n )$ == Space Complexity == $O(nh)$ words (Stores and updates z O(n)-sized vectors designed to converge to some basis vectors) == Description == Personalized PageRank with hubs == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2003 == Reference == http://infolab.stanford.edu/~glenj/spws.pdf" current
- 10:5310:53, 15 February 2023 diff hist +448 N Haveliwala (Link Analysis Link Analysis) Created page with "== Time Complexity == $O(m n )$ == Space Complexity == $O(nz)$? words (Stores and updates z O(n)-sized vectors designed to converge to some stationary distributions) == Description == PageRank with categories/topics == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2002 == Reference == http://www-cs-students.stanford.edu/~taherh/papers/topic-sensitive-pagerank.pdf" current
- 10:5310:53, 15 February 2023 diff hist +461 N PHITS Coheng Chan (Link Analysis Link Analysis) Created page with "== Time Complexity == $O(m n )$ == Space Complexity == $O(nz)$? words (Needs to store P(z), P(d|z), and P(c|z) after each EM iteration (algorithm can be smart about intermediate calculations as to not use more than O(nz) space)) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2000 == Reference == http://web.cse.msu.edu/~cse960/Papers/LinkAnalysis/phits.pdf" current
- 10:5310:53, 15 February 2023 diff hist +347 N Randomized HITS (Link Analysis Link Analysis) Created page with "== Time Complexity == $O(m nlogn )$ == Space Complexity == $O(n)$ words (Stores and updates hub and authority values per node) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2001 == Reference == https://dl.acm.org/doi/pdf/10.1145/383952.384003"
- 10:5310:53, 15 February 2023 diff hist +432 N The (Stochastic Approach for Link Structure Analysis) SALSA Algorithm (Link Analysis Link Analysis) Created page with "== Time Complexity == $O(m^{2} n )$ == Space Complexity == $O(n)$? words (Stores and updates two O(n)-sized vectors (corresponding to 2 random walks) designed to converge to some sort of stationary distribution) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2000 == Reference == https://dl.acm.org/doi/abs/10.1145/382979.383041" current
- 10:5310:53, 15 February 2023 diff hist +325 N Kleinberg (Link Analysis Link Analysis) Created page with "== Time Complexity == $O(m^{2} n )$ == Space Complexity == words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1998 == Reference == https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.585.7341&rep=rep1&type=pdf" current
- 10:5310:53, 15 February 2023 diff hist +346 N The (Hyperlink-Induced Topic Search) HITS Algorithm (Link Analysis Link Analysis) Created page with "== Time Complexity == $O(n^{2} k)$ == Space Complexity == $O(n)$ words (Stores and updates hub and authority values per node) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1998 == Reference == https://dl.acm.org/doi/pdf/10.1145/324133.324140" current
- 10:5310:53, 15 February 2023 diff hist +372 N The INDEGREE Algorithm (InDegree Analysis Link Analysis) Created page with "== Time Complexity == $O(m^{2} n )$ == Space Complexity == $O(n)$ words (Must maintain a list of visited nodes to eliminate duplication.) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1997 == Reference == https://www.w3.org/People/Massimo/papers/quest_hypersearch.pdf"
- 10:5310:53, 15 February 2023 diff hist +392 N The PAGERANK Algorithm (Link Analysis Link Analysis) Created page with "== Time Complexity == $O(m n )$ == Space Complexity == $O(n)$ words (Stores and updates an O(n)-sized vector designed to converge to some sort of stationary distribution) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1998 == Reference == http://ilpubs.stanford.edu:8090/422/1/1999-66.pdf" current
- 10:5310:53, 15 February 2023 diff hist +453 N Naive (All Maximal Non-Branching Paths in a Graph All Maximal Non-Branching Paths in a Graph) Created page with "== Time Complexity == $O(m)$ == Space Complexity == $O(n)$ auxiliary? words (For each vertex, store whether that vertex is a 1-in-1-out vertex (all of these can be pre-computed at the same time in $O(m)$ time). Unclear if there's a better bound) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1940 == Reference == http://rosalind.info/problems/ba3m/"
- 10:5310:53, 15 February 2023 diff hist +418 N Kingsford ( Motif Search) Created page with "== Time Complexity == $O(mn)$ == Space Complexity == $O(m^{2}n^{2})$ words (Creates an ILP with $O(m^2n^2)$ variables and $O(n^2m)$ constraints, each involving $O(m)$ variables) == Description == ILP formulation == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2006 == Reference == https://link.springer.com/chapter/10.1007/11780441_22" current
- 10:5310:53, 15 February 2023 diff hist +364 N Liang Cwinnower ( Motif Search) Created page with "== Time Complexity == $O(nm^{0.5})$ == Space Complexity == $O(m^{2})$ words (Considers a graph on $O(m)$ nodes and $O(m^2)$ edges) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2003 == Reference == https://www.worldscientific.com/doi/10.1142/S0219720004000466" current
- 10:5310:53, 15 February 2023 diff hist +367 N Sagot M ( Motif Search) Created page with "== Time Complexity == $O(n logn m^{1.{4}5})$ == Space Complexity == $O(mn^{2}/w)$ words (https://link.springer.com/chapter/10.1007/BFb0054337) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1988 == Reference == https://link.springer.com/chapter/10.1007/BFb0054337" current
- 10:5310:53, 15 February 2023 diff hist +407 N Bailey TL; Elkan C MEME ( Motif Search) Created page with "== Time Complexity == $O(n^{2}m^{2})$ == Space Complexity == $O(nm)$ words (Uses iterations of the EM algorithm as in (Lawrence, Reilly 1990), and thus uses similar amounts of space) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1995 == Reference == https://link.springer.com/article/10.1007/BF00993379" current
- 10:5310:53, 15 February 2023 diff hist +367 N Sinha S; Tompa M YMF (Yeast Motif Finder) ( Motif Search) Created page with "== Time Complexity == $O(n^{0.{6}6} m)$ == Space Complexity == $O(m)$ words (Derived: store number of occurances for each motif of a specified length) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2000 == Reference == https://www.ncbi.nlm.nih.gov/pubmed/10977095" current
- 10:5310:53, 15 February 2023 diff hist +410 N Tompa M ( Motif Search) Created page with "== Time Complexity == $O(nm)$ == Space Complexity == $O(m^{2})$ words (Requires considering an $O(m^2)*O(m^2)$ matrix with $O(m^2)$ nonzero entries, based on a DFA with $O(m^2)$ states) == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1999 == Reference == https://www.aaai.org/Papers/ISMB/1999/ISMB99-030.pdf" current
- 10:5310:53, 15 February 2023 diff hist +378 N Van Helden J; Rios AF; Collado-Vides J ( Motif Search) Created page with "== Time Complexity == $O(nm)$ == Space Complexity == $O(m)$ words (Derived: store number of occurances for each motif of a specified length) == Description == Dyad analysis == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 2000 == Reference == https://www.ncbi.nlm.nih.gov/pmc/articles/PMC102821/" current
- 10:5310:53, 15 February 2023 diff hist +431 N Helden Oligo-Analysis ( Motif Search) Created page with "== Time Complexity == $O(nm)$ == Space Complexity == $O(m)$ words (Derived: store number of occurances for each motif of a specified length) == Description == Uses oligonucleotides? Also only detects "short" motifs, and used for yeast == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1998 == Reference == https://www.ncbi.nlm.nih.gov/pubmed/9719638" current
- 10:5310:53, 15 February 2023 diff hist +243 N Brute force ( The Set-Covering Problem) Created page with "== Time Complexity == $O(U {2}^n)$ == Space Complexity == $O(U)$ words () == Description == == Approximate? == Exact == Randomized? == No, deterministic == Model of Computation == Word RAM == Year == 1972 == Reference ==" current
- 10:5310:53, 15 February 2023 diff hist +366 N Cardoso; Nuno; Abreu; Rui ( The Set-Covering Problem) Created page with "== 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" current