Image de couverture de livre

Automating the Search for Small Hard Examples to Approximation Algorithms

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteur principal:	Sharma, Eklavya
Format:	Preprint
Publié:	2025
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

Hardness and Approximation Algorithms for Balanced Districting Problems
par: Dharangutte, Prathamesh, et autres
Publié: (2025)

Almost Tight Approximation Hardness and Online Algorithms for Resource Scheduling
par: Das, Rathish, et autres
Publié: (2025)

On the 2D Demand Bin Packing Problem: Hardness and Approximation Algorithms
par: Albers, Susanne, et autres
Publié: (2025)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
par: Khanna, Sanjeev, et autres
Publié: (2025)

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

Hardness and Approximation for Coloring Digraphs
par: Chalermsook, Parinya, et autres
Publié: (2026)

Faster Exponential-Time Approximation Algorithms Using Approximate Monotone Local Search
par: Esmer, Barış Can, et autres
Publié: (2022)

Simple Algorithms for Stochastic Score Classification with Small Approximation Ratios
par: Plank, Benedikt M., et autres
Publié: (2022)

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
par: Andoni, Alexandr, et autres
Publié: (2026)

Capacitated Fair-Range Clustering: Hardness and Approximation Algorithms
par: Gadekar, Ameet, et autres
Publié: (2025)

Hardness of Approximation for Shortest Path with Vector Costs
par: Carlson, Charlie, et autres
Publié: (2025)

Approximations and Hardness of Packing Partially Ordered Items
par: Doron-Arad, Ilan, et autres
Publié: (2024)

Hardness and Tight Approximations of Demand Strip Packing
par: Jansen, Klaus, et autres
Publié: (2024)

Hardness Amplification for Dynamic Binary Search Trees
par: Jiang, Shunhua, et autres
Publié: (2024)

Approximating Small Sparse Cuts
par: Anand, Aditya, et autres
Publié: (2024)

Parameterized Approximation for Capacitated $d$-Hitting Set with Hard Capacities
par: Lokshtanov, Daniel, et autres
Publié: (2024)

New Algorithms and Hardness Results for Connected Clustering
par: Eube, Jan, et autres
Publié: (2025)

On the Complexity of Knapsack under Explorable Uncertainty: Hardness and Algorithms
par: Schlöter, Jens
Publié: (2025)

Algorithms and Hardness Results for the $(k,\ell)$-Cover Problem
par: Madani, Amirali, et autres
Publié: (2025)

The Impact of Approximation on Algorithmic Progress
par: Li, Jeffery, et autres
Publié: (2026)

Anarchy in the APSP: Algorithm and Hardness for Incorrect Implementation of Floyd-Warshall
par: Koo, Jaehyun
Publié: (2024)

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

Approximation Algorithms for Fair Repetitive Scheduling
par: Hermelin, Danny, et autres
Publié: (2025)

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

Approximation Algorithms for Digraph Width Parameters
par: Kintali, Shiva, et autres
Publié: (2011)

The Kernighan-Lin Search Algorithm
par: Dasdan, Ali
Publié: (2025)

Hitting Meets Packing: How Hard Can it Be?
par: Focke, Jacob, et autres
Publié: (2024)

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

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

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

Improved Hardness-of-Approximation for Token Swapping
par: Hiken, Sam, et autres
Publié: (2024)

Fast-Convergent Proximity Graphs for Approximate Nearest Neighbor Search
par: Li, Binhong, et autres
Publié: (2025)

Towards Efficient Data Structures for Approximate Search with Range Queries
par: Kian, Ladan, et autres
Publié: (2026)

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

Efficient and Practical Approximation Algorithms for Advertising in Content Feeds
par: Zhang, Guangyi, et autres
Publié: (2025)

$O(\log n)$-Approximation Algorithms for Bipartiteness Ratio
par: Soma, Tasuku, et autres
Publié: (2025)

An FPT Constant-Factor Approximation Algorithm for Correlation Clustering
par: Zhou, Jianqi, et autres
Publié: (2025)

Parameterized Approximation Algorithms for TSP on Non-Metric Graphs
par: Zhao, Jingyang, et autres
Publié: (2025)

Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
par: Chen, Yong, et autres
Publié: (2025)

Enhanced Approximation Algorithms for the Capacitated Location Routing Problem
par: Zhao, Jingyang, et autres
Publié: (2025)