2012 · 55 citations · 23 references
Cluster ComputingI/o Efficient SetEngineeringComputer ArchitectureParallel ImplementationSequential I/o-efficient AlgorithmsComputational ComplexityParallel MetaheuristicsParallel AlgorithmsParallel Complexity TheoryParallel ComputingCombinatorial OptimizationCombinatorial ProblemComputer EngineeringComputer ScienceParallel ProcessingCloud ComputingParallel ProgrammingDisk-resident InstancesCover Algorithms
This paper presents the design, analysis, and implementation of parallel and sequential I/O-efficient algorithms for set cover, tying together the line of work on parallel set cover and the line of work on efficient set cover algorithms for large, disk-resident instances.
23
What is Twitter, a social network or a news media?
Haewoon Kwak, Changhyun Lee, Hosung Park et al. · 2010 · 6.6K citations
A threshold of ln <i>n</i> for approximating set cover
Uriel Feige · Journal of the ACM · 1998 · 3.1K citations · Full text
Reducibility Among Combinatorial Problems
Kichard Rarp · 2012 · 1.4K citations