Imagen de Portada

Overlap Analysis of the Shortest Path Problem: Local Search, Landscapes, and Franz--Parisi Potential

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Koehler, Frederic, Shin, Joonhyung
Formato:	Preprint
Publicado:	2025
Materias:	Data Structures and Algorithms Combinatorics Probability
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

Trickle-Down in Localization Schemes and Applications
por: Anari, Nima, et al.
Publicado: (2024)

Heights of butterfly trees
por: Peca-Medlin, John, et al.
Publicado: (2025)

Zero-Freeness is All You Need: A Weitz-Type FPTAS for the Entire Lee-Yang Zero-Free Region
por: Shao, Shuai, et al.
Publicado: (2025)

The Horton-Strahler number of butterfly trees
por: Peca-Medlin, John
Publicado: (2025)

An Easy Proof of a Weak Version of Chernoff inequality
por: Har-Peled, Sariel
Publicado: (2025)

Mixing on Generalized Associahedra
por: Chang, William, et al.
Publicado: (2024)

Fast Mixing in Sparse Random Ising Models
por: Liu, Kuikui, et al.
Publicado: (2024)

Minimal spanning arborescence
por: Ray, Gourab, et al.
Publicado: (2024)

Burning rooted graph products
por: Peca-Medlin, John
Publicado: (2026)

Parameterized Shortest Path Reconfiguration
por: Bousquet, Nicolas, et al.
Publicado: (2024)

Approximate Counting in Local Lemma Regimes
por: Mann, Ryan L., et al.
Publicado: (2025)

Improved Shortest Path Restoration Lemmas for Multiple Edge Failures: Trade-offs Between Fault-tolerance and Subpaths
por: Bodwin, Greg, et al.
Publicado: (2023)

On the Two Paths Theorem and the Two Disjoint Paths Problem
por: Humeau, Samuel, et al.
Publicado: (2025)

Local Limits of Small World Networks
por: Alimohammadi, Yeganeh, et al.
Publicado: (2025)

Efficiently learning and sampling multimodal distributions with data-based initialization
por: Koehler, Frederic, et al.
Publicado: (2024)

The Squishy Grid Problem
por: Cai, Zixi, et al.
Publicado: (2025)

A Threshold Phenomenon for the Shortest Lattice Vector Problem in the Infinity Norm
por: Kuhlmann, Stefan, et al.
Publicado: (2025)

Polynomial-time sampling despite disorder chaos
por: Ma, Eric, et al.
Publicado: (2025)

Cycle-factors of regular graphs via entropy
por: Christoph, Micha, et al.
Publicado: (2025)

Quality control in sublinear time: a case study via random graphs
por: Marcussen, Cassandra, et al.
Publicado: (2025)

Decoupling via Affine Spectral-Independence: Beck-Fiala and Komlós Bounds Beyond Banaszczyk
por: Bansal, Nikhil, et al.
Publicado: (2025)

An Improved Upper Bound for the Euclidean TSP Constant Using Band Crossovers
por: Gaudio, Julia, et al.
Publicado: (2026)

Boltzmann Sampling for Powersets without an Oracle
por: Peyen, Jean
Publicado: (2026)

From Zero-Freeness to Strong Spatial Mixing via a Christoffel-Darboux Type Identity
por: Shao, Shuai, et al.
Publicado: (2024)

Integrating High-Dimensional Functions Deterministically
por: Gamarnik, David, et al.
Publicado: (2024)

Average-Case Matrix Discrepancy: Asymptotics and Online Algorithms
por: Kunisky, Dmitriy, et al.
Publicado: (2023)

The Compilability Thresholds of 2-CNF to OBDD
por: de Colnet, Alexis, et al.
Publicado: (2026)

Computational hardness of detecting graph lifts and certifying lift-monotone properties of random regular graphs
por: Kunisky, Dmitriy, et al.
Publicado: (2024)

Strong spatial mixing for colorings on trees and its algorithmic applications
por: Chen, Zongchen, et al.
Publicado: (2023)

Some easy optimization problems have the overlap-gap property
por: Li, Shuangping, et al.
Publicado: (2024)

Probabilistic estimates of the diameters of the Rubik's Cube groups
por: Hirata, So
Publicado: (2024)

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

Approximating the Permanent of a Random Matrix with Polynomially Small Mean: Zeros and Universality
por: Koehler, Frederic, et al.
Publicado: (2026)

The Steiner Shortest Path Tree Problem
por: Asher, Omer, et al.
Publicado: (2025)

An Algebraic Approach to the Longest Path Problem
por: Khazali, Omar Al -
Publicado: (2023)

The Metric Dimension of Sparse Random Graphs
por: Díaz, Josep, et al.
Publicado: (2025)

Paths and Intersections: Exact Emulators for Planar Graphs
por: Li, George Z., et al.
Publicado: (2025)

Minor Containment and Disjoint Paths in almost-linear time
por: Korhonen, Tuukka, et al.
Publicado: (2024)

An FPT Algorithm for the Exact Matching Problem and NP-hardness of Related Problems
por: Murakami, Hitoshi, et al.
Publicado: (2024)