On an Algorithm of Frieze
组合数学
2007-05-23 v4
摘要
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.
引用
@article{arxiv.math/0102155,
title = {On an Algorithm of Frieze},
author = {Howard Kleiman},
journal= {arXiv preprint arXiv:math/0102155},
year = {2007}
}
备注
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