Pages that link to "Item:Q995573"

The following pages link to Approximating the minimum vertex cover in sublinear time and a connection to distributed algorithms (Q995573):

Displayed 31 items.

• Sublinear-time algorithms for monomer-dimer systems on bounded degree graphs (Q401479) ‎ (← links)
• Local computation algorithms for graphs of non-constant degrees (Q524360) ‎ (← links)
• Distributed discovery of large near-cliques (Q661050) ‎ (← links)
• Minimum entropy combinatorial optimization problems (Q693045) ‎ (← links)
• A sublinear-time approximation scheme for bin packing (Q1034628) ‎ (← links)
• Sublinear-time algorithms for counting star subgraphs via edge sampling (Q1709591) ‎ (← links)
• Best of two local models: centralized local and distributed local algorithms (Q1784947) ‎ (← links)
• Almost stable matchings by truncating the Gale-Shapley algorithm (Q1959728) ‎ (← links)
• No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970) ‎ (← links)
• Local algorithms for sparse spanning graphs (Q2300722) ‎ (← links)
• Can we locally compute sparse connected subgraphs? (Q2399362) ‎ (← links)
• New techniques and tighter bounds for local computation algorithms (Q2628795) ‎ (← links)
• Constructing near spanning trees with few local inspections (Q2977565) ‎ (← links)
• An Efficient Partitioning Oracle for Bounded-Treewidth Graphs (Q3088124) ‎ (← links)
• Minimum Entropy Combinatorial Optimization Problems (Q3576040) ‎ (← links)
• Approximately Counting Triangles in Sublinear Time (Q4593251) ‎ (← links)
• The Program of the Mini-Workshop (Q4933360) ‎ (← links)
• Sublinear Graph Approximation Algorithms (Q4933367) ‎ (← links)
• On Constant Time Approximation of Parameters of Bounded Degree Graphs (Q4933372) ‎ (← links)
• Dynamic Approximate Vertex Cover and Maximum Matching (Q4933386) ‎ (← links)
• Weighted Message Passing and Minimum Energy Flow for Heterogeneous Stochastic Block Models with Side Information (Q4969043) ‎ (← links)
• Sublinear Time Estimation of Degree Distribution Moments: The Arboricity Connection (Q4972298) ‎ (← links)
• (Q5002725) ‎ (← links)
• A Simple Sublinear-Time Algorithm for Counting Arbitrary Subgraphs via Edge Sampling (Q5090376) ‎ (← links)
• On Approximating the Number of $k$-Cliques in Sublinear Time (Q5115700) ‎ (← links)
• Round Compression for Parallel Matching Algorithms (Q5130844) ‎ (← links)
• Fully Dynamic Maximal Matching in $O(\log n)$ Update Time (Q5252659) ‎ (← links)
• (Q5743463) ‎ (← links)
• (Q5743464) ‎ (← links)
• Fast distributed algorithms for testing graph properties (Q5915702) ‎ (← links)
• On computing discretized Ricci curvatures of graphs: local algorithms and (localized) fine-grained reductions (Q6076351) ‎ (← links)