Similar Items: An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
- Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
- Polylogarithmic Approximation for Covering and Connecting Multi-Interface Networks
- Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
- Parameterized Local Search for Vertex Cover: When only the Search Radius is Crucial
- A 4.509-Approximation Algorithm for Generalized Min Sum Set Cover
- Faster Deterministic Streaming Vertex Coloring