The following pages link to Anthony Wirth (Q666191):
Displaying 21 items.
- Lock-free parallel dynamic programming (Q666192) (← links)
- The query complexity of estimating weighted averages (Q766183) (← links)
- Correlation clustering in data streams (Q2037102) (← links)
- Asymmetry in \(k\)-center variants (Q2503348) (← links)
- Clustering with qualitative information (Q2568462) (← links)
- (Q3526671) (← links)
- A Local-Search 2-Approximation for 2-Correlation-Clustering (Q3541094) (← links)
- Incidence Geometries and the Pass Complexity of Semi-Streaming Set Cover (Q4575677) (← links)
- On Approximating Target Set Selection (Q4636434) (← links)
- Resolving Rooted Triplet Inconsistency by Dissolving Multigraphs (Q4922133) (← links)
- Metric-Constrained Optimization for Graph Clustering Algorithms (Q5025762) (← links)
- Graph Clustering in All Parameter Regimes (Q5089206) (← links)
- (Q5091036) (← links)
- Precedence-Constrained Min Sum Set Cover (Q5136276) (← links)
- Ranking Tournaments: Local Search and a New Algorithm (Q5233515) (← links)
- Ranking tournaments (Q5406207) (← links)
- Engineering burstsort (Q5406232) (← links)
- (Q5417662) (← links)
- Result-Sensitive Binary Search with Noisy Information (Q5875628) (← links)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques (Q5900922) (← links)
- (Q6065457) (← links)
