:: Library Catalog

Imagen de Portada

Guardado en:

Detalles Bibliográficos
Autor principal:	Kavun, Sergii
Formato:	Preprint
Publicado:	2025
Materias:	Performance Hardware Architecture Computational Complexity Data Structures and Algorithms 68Q25, 68M20, 68W40, 91B74 D.4.8; C.4; F.2.2; K.6.2
Acceso en línea:	https://arxiv.org/abs/2508.13249
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

On (In)approximability of MaxMin Independent Set Reconfiguration
por: Hoang, Hung P., 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)

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 survey on FPGA-based accelerator for ML models
por: Yan, Feng, et al.
Publicado: (2024)

Exact Set Packing in Multimodal Transportation with Ridesharing System for First/Last Mile
por: Gu, Qian-Ping, et al.
Publicado: (2025)

Parallel Algorithms for Group Isomorphism via Code Equivalence
por: Levet, Michael
Publicado: (2026)

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

ARRIVAL: Recursive Framework & $\ell_1$-Contraction
por: Haslebacher, Sebastian
Publicado: (2025)

On Solving Reachability in Grid Digraphs using a Psuedoseparator
por: Jain, Rahul, et al.
Publicado: (2019)

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

Amnesiac Flooding: Easy to break, hard to escape
por: Austin, Henry, et al.
Publicado: (2025)

Many Objective Problems Where Crossover is Provably Essential
por: Opris, Andre
Publicado: (2024)

Optimal non-adaptive algorithm for edge estimation
por: Bishnu, Arijit, et al.
Publicado: (2025)

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

Algorithms for Generating Small Random Samples
por: Cicirello, Vincent A.
Publicado: (2024)

Model-Checking for First-Order Logic with Disjoint Paths Predicates in Proper Minor-Closed Graph Classes
por: Golovach, Petr A., et al.
Publicado: (2022)

Fair Division in a Variable Setting
por: Chandramouleeswaran, Harish, et al.
Publicado: (2024)

On the Parallel Complexity of Group Isomorphism via Weisfeiler-Leman
por: Grochow, Joshua A., et al.
Publicado: (2021)

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

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

Revisiting Chazelle's Implementation of the Bottom-Left Heuristic: A Corrected and Rigorous Analysis
por: Michel, Stefan
Publicado: (2025)

On weighted graph separation problems and flow-augmentation
por: Kim, Eun Jung, et al.
Publicado: (2022)

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

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

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

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

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

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

Probabilistic Approach for Detection of High-Frequency Periodic Signals using an Event Camera
por: Ben-Ezra, David El-Chai, et al.
Publicado: (2022)

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

An Efficient Algorithm for Unbalanced 1D Transportation
por: Gouvine, Gabriel
Publicado: (2023)

Strongly Sublinear Algorithms for Testing Pattern Freeness
por: Newman, Ilan, et al.
Publicado: (2021)

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

Count-Free Weisfeiler--Leman and Group Isomorphism
por: Collins, Nathaniel A., et al.
Publicado: (2022)