Full Text Available
Note: Clicking the button above will open the full text document at the original institutional repository in a new window.
An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
Saved in:
| Published in: | ArXiv cs.DS Recent Papers |
|---|---|
| Format: | Online Article RSS Article |
| Published: |
2026
|
| Subjects: | |
| Tags: |
No Tags, Be the first to tag this record!
|
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