:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Shi, Yangguang, Xue, Zhenyu
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Computer Science and Game Theory Machine Learning 68W27, 68Q32 F.2.2
Online Access:	https://arxiv.org/abs/2507.06509
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

Hairpin Completion Distance Lower Bound
by: Boneh, Itai, et al.
Published: (2024)

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

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

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

The Exchange Problem
by: Garg, Mohit, 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)

Nearly Tight Sample Complexity for Matroid Online Contention Resolution
by: Feldman, Moran, 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)

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

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

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

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

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

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

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

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

Enumeration Kernels of Polynomial Size for Cuts of Bounded Degree
by: Komusiewicz, Christian, et al.
Published: (2023)

Parameterized Algorithms for Kidney Exchange
by: Maiti, Arnab, et al.
Published: (2021)

On the near-tightness of $χ\leq 2r$: a general $σ$-ary construction and a binary case via LFSRs
by: Date, Vinicius T. V., et al.
Published: (2025)

Exact and Approximate High-Multiplicity Scheduling on Identical Machines
by: Jansen, Klaus, et al.
Published: (2024)

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

The Power of Matching for Online Fractional Hedonic Games
by: Bullinger, Martin, et al.
Published: (2025)

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

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

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

Shortest Paths without a Map, but with an Entropic Regularizer
by: Bubeck, Sébastien, et al.
Published: (2022)

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

Steiner Tree Parameterized by Multiway Cut and Even Less
by: Jansen, Bart M. P., et al.
Published: (2024)

The Quasi-probability Method and Applications for Trace Reconstruction
by: Rubinstein, Ittai
Published: (2024)

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

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

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

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

PPSZ is better than you think
by: Scheder, Dominik
Published: (2022)

Deterministically Simulating Barely Random Algorithms in the Random-Order Arrival Model
by: Borodin, Allan, et al.
Published: (2025)

TreeWidzard: An Engine for Width-Based Dynamic Programming and Automated Theorem Proving
by: Oliveria, Mateus de Oliveira, et al.
Published: (2026)