:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Hyatt-Denesik, Dylan, Ameli, Afrouz Jabal, Sanita, Laura
Format:	Preprint
Publié:	2024
Sujets:	Data Structures and Algorithms
Accès en ligne:	https://arxiv.org/abs/2404.08972
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Learning-Augmented Online Covering Problems
par: Ameli, Afrouz Jabal, et autres
Publié: (2025)

Improved Space-Time Tradeoffs for Permutation Problems via Extremal Combinatorics
par: Ameli, Afrouz Jabal, et autres
Publié: (2026)

New Parameterized and Exact Exponential Time Algorithms for Strongly Connected Steiner Subgraph
par: Ameli, Afrouz Jabal, et autres
Publié: (2026)

A $4/3$ Approximation for $2$-Vertex-Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2023)

A $5/4$-Approximation for Two-Edge Connectivity
par: Bosch-Calvo, Miguel, et autres
Publié: (2024)

Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
par: Bansal, Ishan, et autres
Publié: (2024)

Approximation Algorithms for Network Design in Non-Uniform Fault Models
par: Chekuri, Chandra, et autres
Publié: (2024)

Improved Approximation for Ranking on General Graphs
par: Derakhshan, Mahsa, et autres
Publié: (2025)

Improved Additive Approximation Algorithms for APSP
par: Jin, Ce, et autres
Publié: (2025)

An Improved Approximation Algorithm for Metric Triangle Packing
par: Zhao, Jingyang, et autres
Publié: (2024)

Improved FPT Approximation for Non-metric TSP
par: Bampis, Evripidis, et autres
Publié: (2024)

Improved Approximation Algorithms for Three-Dimensional Knapsack
par: Jansen, Klaus, et autres
Publié: (2025)

Improved Sparse Recovery for Approximate Matrix Multiplication
par: Uffenheimer, Yahel, et autres
Publié: (2026)

Improved Approximation Algorithm for Maximum Balanced Biclique
par: Manurangsi, Pasin
Publié: (2026)

Improved Approximations for Dial-a-Ride Problems
par: Zhao, Jingyang, et autres
Publié: (2026)

Improved Combinatorial Approximations for Weighted Correlation Clustering
par: Ostovari, Mojtaba, et autres
Publié: (2023)

An Improved Greedy Approximation for (Metric) $k$-Means
par: Charikar, Moses, et autres
Publié: (2026)

Designing Approximate Binary Trees for Trees
par: Kellerhals, Leon, et autres
Publié: (2026)

An Improved Approximation Algorithm for the Capacitated Arc Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2025)

Improved Approximation Algorithms for Non-Preemptive Throughput Maximization
par: Armbruster, Alexander, et autres
Publié: (2026)

Stochastic Knapsack: Semi-Adaptivity Gaps and Improved Approximation
par: Barak, Zohar, et autres
Publié: (2026)

Improved Approximations for the Unsplittable Capacitated Vehicle Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2026)

Prize-Collecting Forest with Submodular Penalties: Improved Approximation
par: Ahmadi, Ali, et autres
Publié: (2025)

Multidepot Capacitated Vehicle Routing with Improved Approximation Guarantees
par: Zhao, Jingyang, et autres
Publié: (2023)

Approximation Algorithms for Hop Constrained and Buy-at-Bulk Network Design via Hop Constrained Oblivious Routing
par: Chekuri, Chandra, et autres
Publié: (2024)

Approximating Tensor Network Contraction with Sketches
par: Heddes, Mike, et autres
Publié: (2026)

Improved Approximation Algorithms for Capacitated Vehicle Routing with Fixed Capacity
par: Zhao, Jingyang, et autres
Publié: (2022)

An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time
par: Henzinger, Monika, et autres
Publié: (2025)

Improved 2-Approximate Shortest Paths for close vertex pairs
par: Gupta, Manoj
Publié: (2025)

An Improved Approximation Algorithm for Maximum Weight 3-Path Packing
par: Zhao, Jingyang, et autres
Publié: (2025)

Improved Approximation Algorithms for Chromatic and Pseudometric-Weighted Correlation Clustering
par: Fan, Chenglin, et autres
Publié: (2025)

Improved Approximation Algorithms for Relational Clustering
par: Esmailpour, Aryan, et autres
Publié: (2024)

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

Improved Approximation Ratios for the Shortest Common Superstring Problem with Reverse Complements
par: Yamano, Ryosuke, et autres
Publié: (2026)

Improved Space-Efficient Approximate Nearest Neighbor Search Using Function Inversion
par: McCauley, Samuel
Publié: (2024)

Improved Approximation Algorithms for the Multiple-Depot Split Delivery Vehicle Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2026)

Improved Approximation Algorithms by Generalizing the Primal-Dual Method Beyond Uncrossable Functions
par: Bansal, Ishan, et autres
Publié: (2022)

Improved Approximation Algorithms and Hardness Results for Shortest Common Superstring with Reverse Complements
par: Yamano, Ryosuke, et autres
Publié: (2026)

A New Approach for Approximating Directed Rooted Networks
par: Cohen, Sarel, et autres
Publié: (2024)

Probabilistic RNA Designability via Interpretable Ensemble Approximation and Dynamic Decomposition
par: Zhou, Tianshuo, et autres
Publié: (2026)