Imagen de Portada

On the near-tightness of $χ\leq 2r$: a general $σ$-ary construction and a binary case via LFSRs

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Date, Vinicius T. V., Zatesko, Leandro M.
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms 68R15 (Primary), 68W32 (Secondary) F.2.2; E.4
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

A $2$-branching construction for the $χ\leq 2r$ bound
por: Date, Vinicius Tikara Venturi, et al.
Publicado: (2026)

Maximizing Diversity in (near-)Median String Selection
por: Chakraborty, Diptarka, et al.
Publicado: (2026)

Computing and Enumerating Minimal Common Supersequences Between Two Strings
por: Sopp, Braeden, et al.
Publicado: (2026)

String 2-Covers with No Length Restrictions
por: Boneh, Itai, et al.
Publicado: (2024)

Hairpin Completion Distance Lower Bound
por: Boneh, Itai, et al.
Publicado: (2024)

25 Additional Problems -- Extension to the Book "125 Problems in Text Algorithms"
por: Crochemore, Maxime, et al.
Publicado: (2025)

Computing Maximal Repeating Subsequences in a String
por: Gong, Mingyang, et al.
Publicado: (2026)

Searching in trees with monotonic query times
por: Dereniowski, Dariusz, et al.
Publicado: (2024)

On Identifying Critical Network Edges via Analyzing Changes in Shapes (Curvatures)
por: DasGupta, Bhaskar, et al.
Publicado: (2026)

Separating Coverage and Submodular: Maximization Subject to a Cardinality Constraint
por: Filmus, Yuval, et al.
Publicado: (2024)

Fast sampling of satisfying assignments from random $k$-SAT with applications to connectivity
por: Chen, Zongchen, et al.
Publicado: (2022)

Exact Algorithms for MaxCut on Split Graphs
por: Lalovic, Marko
Publicado: (2024)

Improved Approximation Algorithms for Path and Forest Augmentation via a Novel Relaxation
por: Hommelsheim, Felix
Publicado: (2025)

How to Compute a Moving Sum
por: Maslen, David K., et al.
Publicado: (2025)

Fast FPT Algorithms for Grundy Number on Dense Graphs
por: Nezhad, Sina Ghasemi, et al.
Publicado: (2024)

Minimum-cost paths for electric cars
por: Dorfman, Dani, et al.
Publicado: (2024)

Handling LP-Rounding for Hierarchical Clustering and Fitting Distances by Ultrametrics
por: An, Hyung-Chan, et al.
Publicado: (2025)

PPSZ is better than you think
por: Scheder, Dominik
Publicado: (2022)

Naively Sorting Evolving Data is Optimal and Robust
por: Giakkoupis, George, et al.
Publicado: (2024)

Prediction-Augmented Mechanism Design for Weighted Facility Location
por: Shi, Yangguang, et al.
Publicado: (2025)

Dorst-Smeulders Coding for Arbitrary Binary Words
por: De Luca, Alessandro, et al.
Publicado: (2025)

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

Independent Distributions on a Multi-Branching AND-OR Tree of Height 2
por: Shigemizu, Mika, et al.
Publicado: (2018)

Boltzmann sampling and optimal exact-size sampling for directed acyclic graphs
por: Gabryelski, Wojciech, et al.
Publicado: (2026)

Pliability and Approximating Max-CSPs
por: Romero, Miguel, et al.
Publicado: (2019)

On the twin-width of near-regular graphs
por: Heinrich, Irene, et al.
Publicado: (2025)

A near-complete resolution of the exponential-time complexity of k-opt for the traveling salesman problem
por: Heimann, Sophia, et al.
Publicado: (2025)

A 13/6-Approximation for Strip Packing via the Bottom-Left Algorithm
por: Hougardy, Stefan, et al.
Publicado: (2025)

A Space-Efficient Algorithm for Longest Common Almost Increasing Subsequence of Two Sequences
por: Rahat, Md Tanzeem, et al.
Publicado: (2025)

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

Computable Bounds and Monte Carlo Estimates of the Expected Edit Distance
por: Bilardi, Gianfranco, et al.
Publicado: (2022)

Optimizing Exact String Matching via Statistical Anchoring
por: Garraoui, Omar
Publicado: (2025)

Extending the Extension: Deterministic Algorithm for Non-monotone Submodular Maximization
por: Buchbinder, Niv, et al.
Publicado: (2024)

Efficient Binary Decision Diagram Manipulation in External Memory
por: Sølvsten, Steffan Christ, et al.
Publicado: (2021)

On the Approximation Ratio of the $k$-Opt and Lin-Kernighan Algorithm
por: Zhong, Xianghui
Publicado: (2019)

Extending Exact Integrality Gap Computations for the Metric TSP
por: Cook, William, et al.
Publicado: (2026)

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
por: Heimann, Sophia, et al.
Publicado: (2026)

Multi-variable Quantification of BDDs in External Memory using Nested Sweeping (Extended Paper)
por: Sølvsten, Steffan Christ, et al.
Publicado: (2024)

Templated Assembly Theory: An Extension of the Canonical Assembly Index with Block-Compressed Template
por: Masierak, Piotr
Publicado: (2026)

Fairness in the k-Server Problem
por: Daneshvaramoli, Mohammadreza, et al.
Publicado: (2025)