Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms

Keyphrases

• Sublinear Time 100%
• Lunate 100%
• Minimum Vertex Cover 100%
• Distributed Algorithms 100%
• Approximation Algorithms 66%
• Additive Error 66%
• Minimization Problem 66%
• Distributed Approximation Algorithm 66%
• Optimization Problem 33%
• Query Complexity 33%
• Dense Graphs 33%
• Multiplicative Factors 33%
• Randomized Algorithms 33%
• Maximum Degree 33%
• Sublinear Approximation Algorithms 33%
• Vertex Cover Problem 33%
• Minimum Vertex Cover Problem 33%
• Error Parameter 33%
• Dot Operator 33%
• Dominating Set Problem 33%
• Small Constants 33%

Mathematics

• Additive Error 100%
• Minimization Problem 100%
• Query Complexity 50%
• Multiplicative 50%
• Maximum Degree 50%
• Dot Operator 50%
• Dominating Set 50%
• Probability 50%