On an Algorithm of Frieze
| dc.creator | Kleiman, Howard | |
| dc.date | 2001-02-20 | |
| dc.date | 2002-05-29 | |
| dc.date.accessioned | 2026-07-07T04:40:15Z | |
| dc.date.available | 2026-07-07T04:40:15Z | |
| dc.description | The algorithm reduces the running time of an algorithm of Frieze from O(n^{1.5)) to O(n^(4/3 + o)). It also introduces the concept of admissible permutations that is used in algorithms for obtaining solutions to the AP and the TSP. | |
| dc.description | This is a very simple version of the original algorithm together with a detailed illustration of it in Example 2.1 . It is the second chapter of a book - "P = NP? Admissible Permutations and the HCP, the AP, and the TSP" - nearly completed. This version contains two figures | |
| dc.identifier | https://arxiv.org/abs/math/0102155 | |
| dc.identifier | http://arxiv.org/abs/math/0102155 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/60971 | |
| dc.subject | Combinatorics | |
| dc.subject | 05C85 | |
| dc.title | On an Algorithm of Frieze | |
| dc.type | text |