:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Swenson, Krister M.
Format:	Preprint
Published:	2024
Subjects:	Data Structures and Algorithms 68Q25, 68P10, 62P10 F.2.2; G.2.1; J.3
Online Access:	https://arxiv.org/abs/2403.20165
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

XiSort: Deterministic Sorting via IEEE-754 Total Ordering and Entropy Minimization
by: Alpay, Faruk
Published: (2025)

Let them have CAKES: A Cutting-Edge Algorithm for Scalable, Efficient, and Exact Search on Big Data
by: Prior, Morgan E., et al.
Published: (2023)

Interval Graphs are Reconstructible
by: Heinrich, Irene, et al.
Published: (2025)

On (In)approximability of MaxMin Independent Set Reconfiguration
by: Hoang, Hung P., et al.
Published: (2026)

CAFS: A Cache-Aware Frequency Sort for Low-Cardinality Integer Data on x86-64
by: Shlyk, Vasiliy S.
Published: (2026)

Stochastic Indexing Primitives for Non-Deterministic Molecular Archives
by: Alpay, Faruk, et al.
Published: (2026)

An Explicit and Efficient $O(n^2)$-Time Algorithm for Sorting Sumsets
by: Mundhra, S.
Published: (2025)

On the Integrality Gap of Directed Steiner Tree LPs with Relatively Integral Solutions
by: Laekhanukit, Bundit
Published: (2024)

Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
by: Morse, Gregory, et al.
Published: (2026)

Experimental algorithms for the dualization problem
by: Mezzini, Mauro, et al.
Published: (2025)

Quantum Search without Global Diffusion
by: Burke, John, et al.
Published: (2026)

The Bottom-Left Algorithm for the Strip Packing Problem
by: Hougardy, Stefan, et al.
Published: (2024)

Competitive Query Minimization for Stable Matching with One-Sided Uncertainty
by: Bampis, Evripidis, et al.
Published: (2024)

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

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

Simple minimally unsatisfiable subsets of 2-CNFs
by: Kullmann, Oliver, et al.
Published: (2026)

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

Classification via Two-Way Comparisons
by: Chrobak, Marek, et al.
Published: (2023)

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

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

Residual-Entropy Accounting for Routed Atom-Budgeted Learned Indexes
by: Alpay, Faruk, et al.
Published: (2026)

Logarithmic Weisfeiler--Leman and Treewidth
by: Levet, Michael, et al.
Published: (2023)

Canonizing Graphs of Bounded Rank-Width in Parallel via Weisfeiler--Leman
by: Levet, Michael, et al.
Published: (2023)

Tighter Approximation for the Uniform Cost-Distance Steiner Tree Problem
by: Foos, Josefine, et al.
Published: (2023)

The $k$-Opt algorithm for the Traveling Salesman Problem has exponential running time for $k \ge 5$
by: Heimann, Sophia, et al.
Published: (2024)

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

Simple Combinatorial Construction of the $k^{o(1)}$-Lower Bound for Approximating the Parameterized $k$-Clique
by: Chen, Yijia, et al.
Published: (2023)

Continuous Flattening and Reversing of Convex Polyhedral Linkages
by: Demaine, Erik D., et al.
Published: (2024)

On Solving Simple Curved Nonograms
by: Löffler, Maarten, et al.
Published: (2025)

Overlapping Biclustering
by: Bentert, Matthias, et al.
Published: (2025)

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

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

How quickly can you pack short paths? Engineering a search-tree algorithm for disjoint s-t paths of bounded length
by: Huber, Michael Kiran
Published: (2024)

An Allele-Centric Pan-Graph-Matrix Representation for Scalable Pangenome Analysis
by: Garrone, Roberto
Published: (2025)

Quantum Advantage in Computational Chemistry?
by: Gundlach, Hans, et al.
Published: (2025)

Submodular Maximization over a Matroid $k$-Intersection: Multiplicative Improvement over Greedy
by: Feldman, Moran, et al.
Published: (2026)

On the Average-Case Performance of Greedy for Maximum Coverage
by: Balkanski, Eric, et al.
Published: (2026)

Fast Shortest Path in Graphs With Sparse Signed Tree Models and Applications
by: Bonnet, Édouard, et al.
Published: (2026)