No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970): Difference between revisions

@@ Property / cites work @@
+A Local 2-Approximation Algorithm for the Vertex Cover Problem
+Normal rank
@@ Property / cites work @@
+Fast Distributed Approximations in Planar Graphs
@@ Property / cites work: Fast Distributed Approximations in Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q5315023
@@ Property / cites work: Q5315023 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower bounds for local approximation
@@ Property / cites work: Lower bounds for local approximation / rank @@
+Normal rank
@@ Property / cites work @@
+No Sublogarithmic-Time Approximation Scheme for Bipartite Vertex Cover
+Normal rank
@@ Property / cites work @@
+Local Graph Partitions for Approximation and Testing
+Normal rank
@@ Property / cites work @@
+Expander graphs and their applications
@@ Property / cites work: Expander graphs and their applications / rank @@
+Normal rank
@@ Property / cites work @@
+Large deviations for sums of partly dependent random variables
+Normal rank
@@ Property / cites work @@
+What cannot be computed locally!
@@ Property / cites work: What cannot be computed locally! / rank @@
+Normal rank
@@ Property / cites work @@
+The price of being near-sighted
@@ Property / cites work: The price of being near-sighted / rank @@
+Normal rank
@@ Property / cites work @@
+Local Computation
@@ Property / cites work: Local Computation / rank @@
+Normal rank
@@ Property / cites work @@
+Leveraging Linial’s Locality Limit
@@ Property / cites work: Leveraging Linial’s Locality Limit / rank @@
+Normal rank
@@ Property / cites work @@
+Locality in Distributed Graph Algorithms
@@ Property / cites work: Locality in Distributed Graph Algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Low diameter graph decompositions
@@ Property / cites work: Low diameter graph decompositions / rank @@
+Normal rank
@@ Property / cites work @@
+Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
+Normal rank
@@ Property / cites work @@
+What Can be Computed Locally?
@@ Property / cites work: What Can be Computed Locally? / rank @@
+Normal rank
@@ Property / cites work @@
+Q4217266
@@ Property / cites work: Q4217266 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms
+Normal rank
@@ Property / cites work @@
+Distributed Computing: A Locality-Sensitive Approach
+Normal rank
@@ Property / cites work @@
+Survey of local algorithms
@@ Property / cites work: Survey of local algorithms / rank @@
+Normal rank