Image de couverture de livre

9/7-Approximation for Two-Edge-Connectivity and Two-Vertex-Connectivity

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Çivril, Ali
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

A Unified Approach for Approximating 2-Edge-Connected Spanning Subgraph and 2-Vertex-Connected Spanning Subgraph
par: Çivril, Ali
Publié: (2023)

4/3-Approximation of Graphic TSP
par: Çivril, Ali
Publié: (2023)

3/2-Approximation for the Forest Augmentation Problem
par: Çivril, Ali
Publié: (2024)

A Better-Than-$5/4$-Approximation for Two-Edge Connectivity
par: Hommelsheim, Felix, et autres
Publié: (2025)

An Approximation Algorithm for 2-Vertex-Connectivity via Cycle-Restricted 2-Edge-Covers
par: Kobayashi, Yusuke, et autres
Publié: (2026)

Two-Edge Connectivity via Pac-Man Gluing
par: Garg, Mohit, et autres
Publié: (2024)

Computing Vertex and Edge Connectivity of Graphs Embedded with Crossings
par: Biedl, Therese, et autres
Publié: (2024)

Connectivity Labeling Schemes for Edge and Vertex Faults via Expander Hierarchies
par: Long, Yaowei, et autres
Publié: (2024)

Space Complexity of Vertex Connectivity Oracles
par: Pettie, Seth, et autres
Publié: (2022)

The Connected k-Vertex One-Center Problem on Graphs
par: Zhang, Jingru
Publié: (2024)

Directed and Undirected Vertex Connectivity Problems are Equivalent for Dense Graphs
par: Fischer, Olivier, et autres
Publié: (2025)

Deterministic Vertex Connectivity via Common-Neighborhood Clustering and Pseudorandomness
par: Jiang, Yonggang, et autres
Publié: (2025)

Near-Optimal Vertex Fault-Tolerant Labels for Steiner Connectivity
par: Bhanja, Koustav, et autres
Publié: (2025)

Connectivity Oracle Under Vertex Failures by Shortcutting Unbreakable Decomposition
par: Li, Xizhe, et autres
Publié: (2026)

Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time
par: Georgiadis, Loukas, et autres
Publié: (2026)

Parallel Small Vertex Connectivity in Near-Linear Work and Polylogarithmic Depth
par: Jiang, Yonggang, et autres
Publié: (2025)

Connectivity Oracles for Predictable Vertex Failures
par: Hu, Bingbing, et autres
Publié: (2023)

An Approximation Algorithm for $K$-best Enumeration of Minimal Connected Edge Dominating Sets with Cardinality Constraints
par: Kurita, Kazuhiro, et autres
Publié: (2022)

FPT Approximations for Connected Maximum Coverage
par: Inamdar, Tanmay, et autres
Publié: (2026)

Approximation Algorithms for Steiner Connectivity Augmentation
par: Hathcock, Daniel, et autres
Publié: (2023)

Simple Algorithms for Fully Dynamic Edge Connectivity
par: Kenneth-Mordoch, Yotam, et autres
Publié: (2025)

Connectivity Certificate against Bounded-Degree Faults: Simpler, Better and Supporting Vertex Faults
par: Parter, Merav, et autres
Publié: (2024)

Approximating Directed Connectivity in Almost-Linear Time
par: Quanrud, Kent
Publié: (2025)

Approximation Schemes for Planar Graph Connectivity Problems
par: Neuwohner, Meike, et autres
Publié: (2025)

Global vs. s-t Vertex Connectivity Beyond Sequential: Almost-Perfect Reductions & Near-Optimal Separations
par: Blikstad, Joakim, et autres
Publié: (2025)

Fully Dynamic Exact Edge Connectivity in Sublinear Time
par: Goranci, Gramoz, et autres
Publié: (2023)

Approximation Algorithms for Connected Maximum Coverage, Minimum Connected Set Cover, and Node-Weighted Group Steiner Tree
par: D'Angelo, Gianlorenzo, et autres
Publié: (2025)

On Computing Vertex Connectivity of 1-Plane Graphs
par: Biedl, Therese, et autres
Publié: (2022)

Weighted Partition Vertex and Edge Cover
par: Dabas, Rajni, et autres
Publié: (2025)

A Radius-Sensitive Approximation Algorithm for Connected Submodular Maximization
par: Cervenjak, Philip, et autres
Publié: (2026)

Streaming Algorithms for Connectivity Augmentation
par: Jin, Ce, et autres
Publié: (2024)

Ghost Value Augmentation for $k$-Edge-Connectivity
par: Hershkowitz, D Ellis, et autres
Publié: (2023)

Deterministic Edge Connectivity and Max Flow using Subquadratic Cut Queries
par: Anand, Aditya, et autres
Publié: (2024)

A (Very) Nearly Optimal Sketch for $k$-Edge Connectivity Certificates
par: Sawettamalya, Pachara, et autres
Publié: (2025)

Capacitated Partition Vertex Cover and Partition Edge Cover
par: Dabas, Rajni, et autres
Publié: (2025)

Approximating Optimal Labelings for Temporal Connectivity
par: Carnevale, Daniele, et autres
Publié: (2025)

Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems
par: Bentert, Matthias, et autres
Publié: (2025)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
par: Bentert, Matthias, et autres
Publié: (2024)

Strong Conflict-Free Vertex-Connection via Twin Cover: Kernelization and Chromatic Bounds
par: German, Samuel
Publié: (2026)

Caching Connections in Matchings
par: Sadeh, Yaniv, et autres
Publié: (2023)