Pages that link to "Item:Q5361909"
From MaRDI portal
The following pages link to A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds (Q5361909):
Displaying 14 items.
- A fault-containing self-stabilizing \((3-\frac 2{\varDelta+1})\)-approximation algorithm for vertex cover in anonymous networks (Q555319) (← links)
- A simple local 3-approximation algorithm for vertex cover (Q987844) (← links)
- A deterministic distributed 2-approximation for weighted vertex cover in \(O(\log N\log\varDelta/\log^2\log\varDelta)\) rounds (Q1713914) (← links)
- Parallel approximation for partial set cover (Q2243336) (← links)
- No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970) (← links)
- On the distributed decision-making complexity of the minimum vertex cover problem (Q3126012) (← links)
- A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds (Q4640294) (← links)
- Local Algorithms for Bounded Degree Sparsifiers in Sparse Graphs (Q4993322) (← links)
- Fast Distributed Approximation for Max-Cut (Q5056049) (← links)
- Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5918492) (← links)
- Distributed distance-\(r\) covering problems on sparse high-girth graphs (Q5925671) (← links)
- Self-stabilizing vertex cover in anonymous networks with optimal approximation ratio (Q6483544) (← links)
- Optimal distributed covering algorithms (Q6487522) (← links)
- Parameterized distributed algorithms (Q6487523) (← links)
