Pages that link to "Item:Q4640294"

The following pages link to A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds (Q4640294):

Displaying 16 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)
• No sublogarithmic-time approximation scheme for bipartite vertex cover (Q2256970) (← links)
• Optimal distributed covering algorithms (Q2689837) (← links)
• On the distributed decision-making complexity of the minimum vertex cover problem (Q3126012) (← links)
• An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model (Q4620411) (← links)
• A Time Hierarchy Theorem for the LOCAL Model (Q4646447) (← links)
• Distributed set cover approximation: Primal-dual with optimal locality (Q5090914) (← links)
• (Q5090928) (← links)
• A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds (Q5361909) (← links)
• Computing connected-\(k\)-subgraph cover with connectivity requirement (Q6111948) (← links)
• Optimal distributed covering algorithms (Q6487522) (← links)
• Parameterized distributed algorithms (Q6487523) (← links)
• Improved distributed approximations for maximum independent set (Q6535034) (← links)
• Approximation algorithm and FPT algorithm for connected-\(k\)-subgraph cover on minor-free graphs (Q6620013) (← links)