Solving a Random Asymmetric TSP Exactly in Quasi-Polynomial Time w.h.p
Fuente:
arXiv
Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866908709353947136 |
|---|---|
| author | Bell, Tolson Frieze, Alan |
| author_facet | Bell, Tolson Frieze, Alan |
| contents | Let the costs $C(i,j)$ for an instance of the Asymmetric Traveling Salesperson Problem (ATSP) be independent copies of a non-negative random variable $C$ from a class of distributions that include the uniform $[0,1]$ distribution and the exponential mean 1 distribution with mean 1. We describe an algorithm that solves ATSP exactly in time $e^{\log^{2+o(1)}n}$, w.h.p. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_02946 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Solving a Random Asymmetric TSP Exactly in Quasi-Polynomial Time w.h.p Bell, Tolson Frieze, Alan Data Structures and Algorithms Combinatorics Let the costs $C(i,j)$ for an instance of the Asymmetric Traveling Salesperson Problem (ATSP) be independent copies of a non-negative random variable $C$ from a class of distributions that include the uniform $[0,1]$ distribution and the exponential mean 1 distribution with mean 1. We describe an algorithm that solves ATSP exactly in time $e^{\log^{2+o(1)}n}$, w.h.p. |
| title | Solving a Random Asymmetric TSP Exactly in Quasi-Polynomial Time w.h.p |
| topic | Data Structures and Algorithms Combinatorics |
| url | https://arxiv.org/abs/2308.02946 |