Image de couverture de livre

Improved Approximation Algorithms and Hardness Results for Shortest Common Superstring with Reverse Complements

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Yamano, Ryosuke, Shibuya, Tetsuo
Format:	Preprint
Publié:	2026
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

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

Quantum Algorithms for the Shortest Common Superstring and Text Assembling Problems
par: Khadiev, Kamil, et autres
Publié: (2023)

Greedy Conjecture for the Shortest Common Superstring Problem and its Strengthenings
par: Nikolaev, Maksim
Publié: (2024)

An Algorithm for a Variation of the Shortest Common Superstring Problem
par: Gilfanov, Arthur
Publié: (2024)

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

Differentially Private Selection using Smooth Sensitivity
par: Yamamoto, Akito, et autres
Publié: (2024)

Faster Approximation Algorithms for Restricted Shortest Paths in Directed Graphs
par: Ashvinkumar, Vikrant, et autres
Publié: (2024)

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

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

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

Covering Approximate Shortest Paths with DAGs
par: Assadi, Sepehr, et autres
Publié: (2025)

Approximation Algorithms for $\ell_p$-Shortest Path and $\ell_p$-Group Steiner Tree
par: Makarychev, Yury, et autres
Publié: (2024)

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

Automating the Search for Small Hard Examples to Approximation Algorithms
par: Sharma, Eklavya
Publié: (2025)

On Incremental Approximate Shortest Paths in Directed Graphs
par: Górkiewicz, Adam, et autres
Publié: (2025)

Improved Approximation Guarantees and Hardness Results for MNL-Driven Product Ranking
par: Segev, Danny, et autres
Publié: (2025)

Cycle Counting under Local Differential Privacy for Degeneracy-bounded Graphs
par: Hillebrand, Quentin, et autres
Publié: (2024)

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

Faster Algorithms for Shortest Unique or Absent Substrings
par: Charalampopoulos, Panagiotis, et autres
Publié: (2026)

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

New Tradeoffs for Decremental Approximate All-Pairs Shortest Paths
par: Dory, Michal, et autres
Publié: (2022)

Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
par: Bentert, Matthias, et autres
Publié: (2024)

Lower Bounds for Approximate (& Exact) k-Disjoint-Shortest-Paths
par: Chitnis, Rajesh, et autres
Publié: (2024)

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

Faster Algorithms for Reverse Shortest Path in Unit-Disk Graphs and Related Geometric Optimization Problems: Improving the Shrink-and-Bifurcate Technique
par: Chan, Timothy M., et autres
Publié: (2025)

Massively Parallel Algorithms for Approximate Shortest Paths
par: Dory, Michal, et autres
Publié: (2024)

An Improved Algorithm for Shortest Paths in Weighted Unit-Disk Graphs
par: Brewer, Bruce W., et autres
Publié: (2024)

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

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

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

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

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

Efficient Algorithms for Disjoint Shortest Paths Problem and its Extensions
par: Choudhary, Keerti, et autres
Publié: (2025)

Lossless Derandomization for Undirected Single-Source Shortest Paths and Approximate Distance Oracles
par: Yan, Shuyi
Publié: (2025)

Hardness and Algorithmic Results for Roman \{3\}-Domination
par: Reddy, Sangam Balchandar
Publié: (2025)

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

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

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

Lower Bounds for Adaptive Relaxation-Based Algorithms for Single-Source Shortest Paths
par: Atalig, Sunny, et autres
Publié: (2024)

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