Copertina

A $4/3$ Approximation for $2$-Vertex-Connectivity

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Bosch-Calvo, Miguel, Grandoni, Fabrizio, Ameli, Afrouz Jabal
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Data Structures and Algorithms 68W25 (Primary) 68W40, 68R10, 05C40, 05C85 (Secondary) F.2.2
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

A $5/4$-Approximation for Two-Edge Connectivity
di: Bosch-Calvo, Miguel, et al.
Pubblicazione: (2024)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
di: Hommelsheim, Felix
Pubblicazione: (2025)

Exact Algorithms for MaxCut on Split Graphs
di: Lalovic, Marko
Pubblicazione: (2024)

On the Average-Case Performance of Greedy for Maximum Coverage
di: Balkanski, Eric, et al.
Pubblicazione: (2026)

A Constant-factor Approximation for Weighted Bond Cover
di: Kim, Eun Jung, et al.
Pubblicazione: (2021)

Traffic-Oblivious Multi-Commodity Flow Network Design
di: Chimani, Markus, et al.
Pubblicazione: (2025)

Fundamentals of Partial Rejection Sampling
di: Jerrum, Mark
Pubblicazione: (2021)

Shortest two disjoint paths in conservative graphs
di: Schlotter, Ildikó
Pubblicazione: (2023)

The Distributional Tail of Worst-Case Quickselect
di: Płecha, Witold
Pubblicazione: (2026)

Cluster Before You Hallucinate: Approximating Node-Capacitated Network Design and Energy Efficient Routing
di: Krishnaswamy, Ravishankar, et al.
Pubblicazione: (2014)

Amnesiac Flooding: Easy to break, hard to escape
di: Austin, Henry, et al.
Pubblicazione: (2025)

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
di: Michel, Stefan
Pubblicazione: (2025)

How to Compute a Moving Sum
di: Maslen, David K., et al.
Pubblicazione: (2025)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
di: Mundhra, S.
Pubblicazione: (2025)

Asymptotics of the Minimal Feedback Arc Set in Erdős-Rényi Graphs
di: Diamond, Harvey, et al.
Pubblicazione: (2024)

Asymptotic Lower Bounds for the Feedback Arc Set Problem in Random Graphs
di: Diamond, Harvey, et al.
Pubblicazione: (2024)

Critical Relaxed-Stable Matchings with Ties in the Many-to-Many Setting
di: Nasre, Meghana, et al.
Pubblicazione: (2023)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
di: Buchbinder, Niv, et al.
Pubblicazione: (2024)

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
di: Buchbinder, Niv, et al.
Pubblicazione: (2024)

ARRIVAL: Recursive Framework & $\ell_1$-Contraction
di: Haslebacher, Sebastian
Pubblicazione: (2025)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
di: DasGupta, Bhaskar, et al.
Pubblicazione: (2026)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
di: Hougardy, Stefan, et al.
Pubblicazione: (2025)

Zero-free regions of partition functions with applications to algorithms and graph limits
di: Regts, Guus
Pubblicazione: (2015)

Learning-Augmented Algorithms for MTS with Bandit Access to Multiple Predictors
di: Coşa, Matei Gabriel, et al.
Pubblicazione: (2025)

Bicriteria Submodular Maximization
di: Feldman, Moran, et al.
Pubblicazione: (2025)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
di: Sopp, Braeden, et al.
Pubblicazione: (2026)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
di: Chen, Zongchen, et al.
Pubblicazione: (2022)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
di: Morse, Gregory, et al.
Pubblicazione: (2026)

Pliability and Approximating Max-CSPs
di: Romero, Miguel, et al.
Pubblicazione: (2019)

Extending Exact Integrality Gap Computations for the Metric TSP
di: Cook, William, et al.
Pubblicazione: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
di: Heimann, Sophia, et al.
Pubblicazione: (2026)

Young domination on Hamming rectangles
di: Gravner, Janko, et al.
Pubblicazione: (2025)

Refutation of Spectral Graph Theory Conjectures with Search Algorithms)
di: Roucairol, Milo, et al.
Pubblicazione: (2024)

Exact Algorithms and Lower Bounds for Stable Instances of Euclidean k-Means
di: Friggstad, Zachary, et al.
Pubblicazione: (2018)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
di: Heimann, Sophia, et al.
Pubblicazione: (2025)

The Power of Filling in Balanced Allocations
di: Los, Dimitrios, et al.
Pubblicazione: (2022)

Mean-Biased Processes for Balanced Allocations
di: Los, Dimitrios, et al.
Pubblicazione: (2023)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
di: Zhong, Xianghui
Pubblicazione: (2019)

Point Location in Constant Time
di: Chaganti, Sairam, et al.
Pubblicazione: (2023)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
di: Heimann, Sophia, et al.
Pubblicazione: (2024)