:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Author:	Kim, Kyeong Soo
Format:	Preprint
Published:	2026
Subjects:	Data Structures and Algorithms Networking and Internet Architecture 65Y20 (Primary) 68M18, 68Q25 (Secondary) C.2.1; F.2.1; F.2.3; G.1.5; G.1.10
Online Access:	https://arxiv.org/abs/2605.21400
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Armadillo: An Efficient Framework for Numerical Linear Algebra
by: Sanderson, Conrad, et al.
Published: (2025)

Fast GPU Linear Algebra via Compile Time Expression Fusion
by: Curtin, Ryan R., et al.
Published: (2026)

No Traffic to Cry: Traffic-Oblivious Link Deactivation for Green Traffic Engineering
by: Ilsen, Max, et al.
Published: (2026)

Reducing the Space Used by the Sieve of Eratosthenes When Factoring
by: Hartman, Samuel, et al.
Published: (2024)

Faster Algorithms for Structured Matrix Multiplication via Flip Graph Search
by: Khoruzhii, Kirill, et al.
Published: (2025)

Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision
by: Koiran, Pascal, et al.
Published: (2022)

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

Designing Capacitated Subnetworks for Shortest Path Routing
by: Chimani, Markus, et al.
Published: (2026)

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

A note on the parameter $\ell$ in Buchbinder--Feldman's deterministic submodular matroid algorithm
by: Li, Shisheng
Published: (2026)

Undercomplete Decomposition of Symmetric Tensors in Linear Time, and Smoothed Analysis of the Condition Number
by: Koiran, Pascal, et al.
Published: (2024)

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

Matrix-by-matrix multiplication algorithm with $O(N^2log_2N)$ computational complexity for variable precision arithmetic
by: Paszyński, Maciej
Published: (2024)

Pure Data Spaces
by: Youssef, Saul
Published: (2025)

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

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)

On the Average Runtime of an Open Source Binomial Random Variate Generation Algorithm
by: Cicirello, Vincent A.
Published: (2024)

Fast Evaluation of Truncated Neumann Series by Low-Product Radix Kernels
by: Sao, Piyush
Published: (2026)

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

Data-Adaptive Low-Rank Sparse Subspace Clustering
by: Kopriva, Ivica
Published: (2025)

Safety-Certified CRT Sparse FFT: $Ω(k^2)$ Lower Bound and $O(N \log N)$ Worst-Case
by: Flouro, Aaron R., et al.
Published: (2026)

Approximating Graphic Multi-Path TSP and Graphic Ordered TSP
by: Alimi, Morteza, et al.
Published: (2025)

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

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

Advances in Quantum Genetic Algorithms
by: Lima, Dennis, et al.
Published: (2025)

Quantum walk informed variational algorithm design
by: Matwiejew, Edric, et al.
Published: (2024)

A Simple and Efficient Algorithm for Sorting Signed Permutations by Reversals
by: Swenson, Krister M.
Published: (2024)

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

IECZ-III: Hardcore Condensation Lift with Size-Aware Invariants
by: Lela, Marko
Published: (2025)

Totally Greedy Sequences Defined by Second-Order Linear Recurrences With Constant Coefficients
by: Pérez-Rosés, Hebert
Published: (2024)

Greedy Sets and Greedy Numerical Semigroups
by: Pérez-Rosés, Hebert, et al.
Published: (2024)

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

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

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

Succinct QUBO formulations for permutation problems by sorting networks
by: Friedl, Katalin, et al.
Published: (2026)

Tensor Decomposition for Non-Clifford Gate Minimization
by: Khoruzhii, Kirill, et al.
Published: (2026)

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

Which graph motif parameters count?
by: Bläser, Markus, et al.
Published: (2025)

Unsplittable Multicommodity Flows in Outerplanar Graphs
by: Alemán-Espinosa, David, et al.
Published: (2025)