Copertina

3/2-Approximation for the Forest Augmentation Problem

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autore principale:	Çivril, Ali
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Data Structures and Algorithms
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

4/3-Approximation of Graphic TSP
di: Çivril, Ali
Pubblicazione: (2023)

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

9/7-Approximation for Two-Edge-Connectivity and Two-Vertex-Connectivity
di: Çivril, Ali
Pubblicazione: (2024)

2-Approximation for Prize-Collecting Steiner Forest
di: Ahmadi, Ali, et al.
Pubblicazione: (2023)

A Better-Than-2 Approximation for the Directed Tree Augmentation Problem
di: Neuwohner, Meike, et al.
Pubblicazione: (2025)

Breaking a Long-Standing Barrier: 2-$\varepsilon$ Approximation for Steiner Forest
di: Ahmadi, Ali, et al.
Pubblicazione: (2025)

Prize-Collecting Forest with Submodular Penalties: Improved Approximation
di: Ahmadi, Ali, et al.
Pubblicazione: (2025)

Learning-Augmented Streaming Algorithms for Approximating MAX-CUT
di: Dong, Yinhao, et al.
Pubblicazione: (2024)

Parsimonious Learning-Augmented Approximations for Dense Instances of $\mathcal{NP}$-hard Problems
di: Bampis, Evripidis, et al.
Pubblicazione: (2024)

Steiner Forest: A Simplified Better-Than-2 Approximation
di: Gupta, Anupam, et al.
Pubblicazione: (2025)

A Polylogarithmic Approximation for Directed Steiner Forest in Planar Digraphs
di: Chekuri, Chandra, et al.
Pubblicazione: (2024)

Approximation Algorithms for Steiner Connectivity Augmentation
di: Hathcock, Daniel, et al.
Pubblicazione: (2023)

On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms
di: Albers, Susanne, et al.
Pubblicazione: (2025)

Hardness and Approximation Algorithms for Balanced Districting Problems
di: Dharangutte, Prathamesh, et al.
Pubblicazione: (2025)

Improved Approximations for Dial-a-Ride Problems
di: Zhao, Jingyang, et al.
Pubblicazione: (2026)

On the Approximability of the Traveling Salesman Problem with Line Neighborhoods
di: Antoniadis, Antonios, et al.
Pubblicazione: (2020)

Optimal 4-Approximation for the Correlated Pandora's Problem
di: Bansal, Nikhil, et al.
Pubblicazione: (2025)

New Approximation Guarantees for The Inventory Staggering Problem
di: Alon, Noga, et al.
Pubblicazione: (2025)

Approximation Schemes for Planar Graph Connectivity Problems
di: Neuwohner, Meike, et al.
Pubblicazione: (2025)

Learning-Augmented Online Covering Problems
di: Ameli, Afrouz Jabal, et al.
Pubblicazione: (2025)

A $\frac{4}{3}$-Approximation for the Maximum Leaf Spanning Arborescence Problem in DAGs
di: Neuwohner, Meike
Pubblicazione: (2024)

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

Improved Approximations for the Unsplittable Capacitated Vehicle Routing Problem
di: Zhao, Jingyang, et al.
Pubblicazione: (2026)

Exponential-Time Approximation (Schemes) for Vertex-Ordering Problems
di: Bentert, Matthias, et al.
Pubblicazione: (2025)

Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
di: Chen, Yong, et al.
Pubblicazione: (2025)

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees
di: Dempsey, Jordan, et al.
Pubblicazione: (2024)

Approximating Traveling Salesman Problems Using a Bridge Lemma
di: Böhm, Martin, et al.
Pubblicazione: (2024)

Approximating the Geometric Knapsack Problem in Near-Linear Time and Dynamically
di: Buchem, Moritz, et al.
Pubblicazione: (2024)

Near-Tight Approximation Algorithms for Bottleneck Multiple Knapsack Problems
di: Chen, Lin, et al.
Pubblicazione: (2026)

Optimal Approximations for the Requirement Cut Problem on Sparse Graph Classes
di: Mallek, Nadym, et al.
Pubblicazione: (2025)

Approximation Algorithms for the Cumulative Vehicle Routing Problem with Stochastic Demands
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

On Tight FPT Time Approximation Algorithms for k-Clustering Problems
di: Dai, Han, et al.
Pubblicazione: (2025)

A Survey of Approximability Results for Traveling Salesman Problems using the TSP-T3CO Definition Scheme
di: Saller, Sophia, et al.
Pubblicazione: (2023)

Sublinear Metric Steiner Forest via Maximal Independent Set
di: Mahabadi, Sepideh, et al.
Pubblicazione: (2025)

Improved Approximation Ratios for the Shortest Common Superstring Problem with Reverse Complements
di: Yamano, Ryosuke, et al.
Pubblicazione: (2026)

Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem
di: Zhao, Jingyang, et al.
Pubblicazione: (2026)

An Efficient Massively Parallel Constant-Factor Approximation Algorithm for the $k$-Means Problem
di: Cohen-Addad, Vincent, et al.
Pubblicazione: (2025)

Approximating Energy-Constrained Drone Delivery Packing Problem for Last-Mile Logistics
di: Jana, Saswata, et al.
Pubblicazione: (2026)

Approximations for the Weighted Reversal, Transposition, and Indel Distance Problem with Intergenic Region Information
di: Siqueira, Gabriel, et al.
Pubblicazione: (2025)