The following pages link to Gregory Schwartzman (Q1660918):
Displaying 16 items.
- A deterministic distributed 2-approximation for weighted vertex cover in \(O(\log N\log\varDelta/\log^2\log\varDelta)\) rounds (Q1713914) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q2189176) (← links)
- Optimal distributed covering algorithms (Q2689837) (← links)
- A (2 + ∊)-Approximation for Maximum Weight Matching in the Semi-Streaming Model (Q4575888) (← links)
- A (2+ϵ)-Approximation for Maximum Weight Matching in the Semi-streaming Model (Q4629986) (← links)
- A Distributed (2 + ε)-Approximation for Vertex Cover in O(log Δ / ε log log Δ) Rounds (Q4640294) (← links)
- (Q5090928) (← links)
- Optimal Distributed Covering Algorithms (Q5145187) (← links)
- A Distributed (2+ε)-Approximation for Vertex Cover in O(logδ/ε log log δ) Rounds (Q5361909) (← links)
- Distributed Approximation of Maximum Independent Set and Maximum Matching (Q5368958) (← links)
- Brief Announcement: Improved Distributed Approximations for Maximum-Weight Independent Set (Q5855246) (← links)
- Fast distributed algorithms for testing graph properties (Q5915702) (← links)
- (Q6083403) (← links)
- Derandomizing local distributed algorithms under bandwidth restrictions (Q6487482) (← links)
- Optimal distributed covering algorithms (Q6487522) (← links)
- Parameterized distributed algorithms (Q6487523) (← links)
