Imagen de Portada

Probabilistic Analysis of Edge Elimination for Euclidean TSP

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autor principal:	Zhong, Xianghui
Formato:	Preprint
Publicado:	2018
Materias:	Discrete Mathematics Computational Complexity Data Structures and Algorithms Combinatorics 68Q87 (Primary) 68W40 (Secondary) F.2.2; G.2.1; G.3
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

Deterministic Algorithm and Faster Algorithm for Submodular Maximization subject to a Matroid Constraint
por: Buchbinder, Niv, et al.
Publicado: (2024)

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

On the PLS-Completeness of $k$-Opt Local Search for the Traveling Salesman Problem
por: Heimann, Sophia, et al.
Publicado: (2026)

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

Dorst-Smeulders Coding for Arbitrary Binary Words
por: De Luca, Alessandro, et al.
Publicado: (2025)

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

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

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

Bicriteria Submodular Maximization
por: Feldman, Moran, et al.
Publicado: (2025)

The Power of Filling in Balanced Allocations
por: Los, Dimitrios, et al.
Publicado: (2022)

Mean-Biased Processes for Balanced Allocations
por: Los, Dimitrios, et al.
Publicado: (2023)

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

Interval Graphs are Reconstructible
por: Heinrich, Irene, et al.
Publicado: (2025)

A Fast 3-Approximation for the Capacitated Tree Cover Problem with Edge Loads
por: Rockel-Wolff, Benjamin
Publicado: (2024)

Incremental-Decremental Maximization
por: Disser, Yann, et al.
Publicado: (2025)

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

Searching in trees with monotonic query times
por: Dereniowski, Dariusz, et al.
Publicado: (2024)

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

Nearly Tight Sample Complexity for Matroid Online Contention Resolution
por: Feldman, Moran, et al.
Publicado: (2025)

Mim-Width is paraNP-complete
por: Bergougnoux, Benjamin, et al.
Publicado: (2025)

Answering Related Questions
por: Bonnet, Édouard
Publicado: (2025)

Treewidth Inapproximability and Tight ETH Lower Bound
por: Bonnet, Édouard
Publicado: (2024)

Coloring Hardness on Low Twin-Width Graphs
por: Bonnet, Édouard
Publicado: (2025)

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

Simple Approximations for General Spanner Problems
por: Bökler, Fritz, et al.
Publicado: (2025)

Exact Minimum Weight Spanners via Column Generation
por: Bökler, Fritz, et al.
Publicado: (2024)

Star-Struck by Fixed Embeddings: Modern Crossing Number Heuristics
por: Chimani, Markus, et al.
Publicado: (2021)

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

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