Copertina

Improved Approximations for Flexible Network Design

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Hyatt-Denesik, Dylan, Ameli, Afrouz Jabal, Sanita, Laura
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

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

Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics
di: Ameli, Afrouz Jabal, et al.
Pubblicazione: (2026)

New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
di: Ameli, Afrouz Jabal, et al.
Pubblicazione: (2026)

A $4/3$ Approximation for $2$-Vertex-Connectivity
di: Bosch-Calvo, Miguel, et al.
Pubblicazione: (2023)

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

Approximation Algorithms for Network Design in Non-Uniform Fault Models
di: Chekuri, Chandra, et al.
Pubblicazione: (2024)

Improved Approximation for Ranking on General Graphs
di: Derakhshan, Mahsa, et al.
Pubblicazione: (2025)

Improved Additive Approximation Algorithms for APSP
di: Jin, Ce, et al.
Pubblicazione: (2025)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
di: Bansal, Ishan, et al.
Pubblicazione: (2024)

An Improved Approximation Algorithm for Metric Triangle Packing
di: Zhao, Jingyang, et al.
Pubblicazione: (2024)

Improved FPT Approximation for Non-metric TSP
di: Bampis, Evripidis, et al.
Pubblicazione: (2024)

Improved Approximation Algorithms for Three-Dimensional Knapsack
di: Jansen, Klaus, et al.
Pubblicazione: (2025)

Improved Sparse Recovery for Approximate Matrix Multiplication
di: Uffenheimer, Yahel, et al.
Pubblicazione: (2026)

Improved Approximation Algorithm for Maximum Balanced Biclique
di: Manurangsi, Pasin
Pubblicazione: (2026)

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

Improved Combinatorial Approximations for Weighted Correlation Clustering
di: Ostovari, Mojtaba, et al.
Pubblicazione: (2023)

An Improved Greedy Approximation for (Metric) $k$-Means
di: Charikar, Moses, et al.
Pubblicazione: (2026)

Designing Approximate Binary Trees for Trees
di: Kellerhals, Leon, et al.
Pubblicazione: (2026)

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

Improved Approximation Algorithms for Non-Preemptive Throughput Maximization
di: Armbruster, Alexander, et al.
Pubblicazione: (2026)

Stochastic Knapsack: Semi-Adaptivity Gaps and Improved Approximation
di: Barak, Zohar, et al.
Pubblicazione: (2026)

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

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

Multidepot Capacitated Vehicle Routing with Improved Approximation Guarantees
di: Zhao, Jingyang, et al.
Pubblicazione: (2023)

Approximation Algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing
di: Chekuri, Chandra, et al.
Pubblicazione: (2024)

Approximating Tensor Network Contraction with Sketches
di: Heddes, Mike, et al.
Pubblicazione: (2026)

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity
di: Zhao, Jingyang, et al.
Pubblicazione: (2022)

An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time
di: Henzinger, Monika, et al.
Pubblicazione: (2025)

Improved 2-Approximate Shortest Paths for close vertex pairs
di: Gupta, Manoj
Pubblicazione: (2025)

An Improved Approximation Algorithm for Maximum Weight 3-Path Packing
di: Zhao, Jingyang, et al.
Pubblicazione: (2025)

Improved Approximation Algorithms for Chromatic and Pseudometric-Weighted Correlation Clustering
di: Fan, Chenglin, et al.
Pubblicazione: (2025)

Improved FPT Approximation Scheme and Approximate Kernel for Biclique-Free Max k-Weight SAT: Greedy Strikes Back
di: Manurangsi, Pasin
Pubblicazione: (2024)

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

Improved Approximation Algorithms for Relational Clustering
di: Esmailpour, Aryan, et al.
Pubblicazione: (2024)

Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion
di: McCauley, Samuel
Pubblicazione: (2024)

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

Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions
di: Bansal, Ishan, et al.
Pubblicazione: (2022)

Improved Approximation Algorithms and Hardness Results for Shortest Common Superstring with Reverse Complements
di: Yamano, Ryosuke, et al.
Pubblicazione: (2026)

A New Approach for Approximating Directed Rooted Networks
di: Cohen, Sarel, et al.
Pubblicazione: (2024)

Probabilistic RNA Designability via Interpretable Ensemble Approximation and Dynamic Decomposition
di: Zhou, Tianshuo, et al.
Pubblicazione: (2026)