Imagen de Portada

The Kernighan-Lin Search Algorithm

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Dasdan, Ali
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Bounds on Longest Simple Cycles in Weighted Directed Graphs via Optimum Cycle Means
por: Dasdan, Ali
Publicado: (2025)

Multi-armed Bandit and Backbone boost Lin-Kernighan-Helsgaun Algorithm for the Traveling Salesman Problems
por: Wang, Long, et al.
Publicado: (2025)

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

Graph-Based Algorithms for Diverse Similarity Search
por: Anand, Piyush, et al.
Publicado: (2025)

Automating the Search for Small Hard Examples to Approximation Algorithms
por: Sharma, Eklavya
Publicado: (2025)

Sparse Navigable Graphs for Nearest Neighbor Search: Algorithms and Hardness
por: Khanna, Sanjeev, et al.
Publicado: (2025)

Efficient Algorithms for Adversarially Robust Approximate Nearest Neighbor Search
por: Andoni, Alexandr, et al.
Publicado: (2026)

Streaming Algorithms for Network Design
por: Chekuri, Chandra, et al.
Publicado: (2025)

Streaming Algorithms for Connectivity Augmentation
por: Jin, Ce, et al.
Publicado: (2024)

Faster Algorithm for Bounded Tree Edit Distance in the Low-Distance Regime
por: Kociumaka, Tomasz, et al.
Publicado: (2025)

Fully Dynamic Algorithms for Transitive Reduction
por: Goranci, Gramoz, et al.
Publicado: (2025)

Learning-Augmented Streaming Algorithms for Approximating MAX-CUT
por: Dong, Yinhao, et al.
Publicado: (2024)

Quantization for Vector Search under Streaming Updates
por: Aden-Ali, Ishaq, et al.
Publicado: (2025)

qPMS Sigma -- An Efficient and Exact Parallel Algorithm for the Planted $(l, d)$ Motif Search Problem
por: Dhar, Saurav, et al.
Publicado: (2024)

Why is My Route Different Today? An Algorithm for Explaining Route Selection
por: Schild, Aaron, et al.
Publicado: (2025)

An Optimal Algorithm for Stochastic Vertex Cover
por: Brand, Jan van den, et al.
Publicado: (2026)

Tree Search With Predictions
por: Dinitz, Michael, et al.
Publicado: (2026)

Optimizing Search Strategies: A Study of Two-Pointer Linear Search Implementation
por: Zinnia, Nazma Akter, et al.
Publicado: (2024)

Learning-Based Algorithms for Graph Searching Problems
por: DePavia, Adela Frances, et al.
Publicado: (2024)

Bounds and Algorithms for Alphabetic Codes and Binary Search Trees
por: Bruno, Roberto, et al.
Publicado: (2024)

Streaming Algorithms via Local Algorithms for Maximum Directed Cut
por: Saxena, Raghuvansh R., et al.
Publicado: (2024)

A Comprehensive Evaluation of Vertex Elimination Algorithms for Algorithmic Differentiation
por: Crane, Alex, et al.
Publicado: (2026)

Approximation Algorithms for Budget Splitting in Multi-Channel Influence Maximization
por: Ali, Dildar, et al.
Publicado: (2026)

Search Trees on Trees via LP
por: Sadeh, Yaniv, et al.
Publicado: (2025)

Testing Depth First Search Numbering
por: Czumaj, Artur, et al.
Publicado: (2025)

Hierarchical Multicriteria Shortest Path Search
por: Kurbanov, Temirlan, et al.
Publicado: (2025)

Methodology of Algorithm Engineering
por: Mendling, Jan, et al.
Publicado: (2023)

Dynamic Breadth First Search with Predictions
por: Khan, Shahbaz, et al.
Publicado: (2026)

Competitive Search in the Line and the Star with Predictions
por: Angelopoulos, Spyros
Publicado: (2023)

Local Search k-means++ with Foresight
por: Conrads, Theo, et al.
Publicado: (2024)

Quantum Algorithm for Searching for the Longest Segment and the Largest Empty Rectangle
por: Khadiev, Kamil, et al.
Publicado: (2025)

Analysis of a Random Local Search Algorithm for Dominating Set
por: Higl, Hendrik
Publicado: (2026)

Efficient Semi-External Breadth-First Search
por: Wan, Xiaolong, et al.
Publicado: (2025)

Local Search for Clustering in Almost-linear Time
por: Jiang, Shaofeng H. -C., et al.
Publicado: (2025)

Hardness Amplification for Dynamic Binary Search Trees
por: Jiang, Shunhua, et al.
Publicado: (2024)

Searching 2D-Strings for Matching Frames
por: Boneh, Itai, et al.
Publicado: (2023)

Noisy (Binary) Searching: Simple, Fast and Correct
por: Dereniowski, Dariusz, et al.
Publicado: (2021)

Sum Estimation via Vector Similarity Search
por: Mussmann, Stephen, et al.
Publicado: (2026)

Scalable $k$-clique Densest Subgraph Search
por: Ye, Xiaowei, et al.
Publicado: (2024)

Distributed Algorithms for Euclidean Clustering
por: Cohen-Addad, Vincent, et al.
Publicado: (2026)