On an Algorithm of Frieze
Abstract
The algorithm reduces the running time of an algorithm of Frieze from O(n1.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.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.