Pages that link to "Item:Q3646226"
From MaRDI portal
The following pages link to A Local 2-Approximation Algorithm for the Vertex Cover Problem (Q3646226):
Displaying 11 items.
- Analysing local algorithms in location-aware quasi-unit-disk graphs (Q642985) (← links)
- Local approximability of max-min and min-max linear programs (Q693753) (← links)
- Linear-in-\(\varDelta \) lower bounds in the LOCAL model (Q1689747) (← links)
- No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970) (← links)
- Optimal distributed covering algorithms (Q2689837) (← links)
- Fast and Simple Local Algorithms for 2-Edge Dominating Sets and 3-Total Vertex Covers (Q2803828) (← links)
- Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
- Parameterized and Exact Computation (Q5311519) (← links)
- (Q5420473) (← links)
- Weak models of distributed computing, with connections to modal logic (Q5918244) (← links)
- Distributed half-integral matching and beyond (Q6199402) (← links)