GitHub

Prim's Algorithm.md

Like Kruskal's algorithm, Prim's algorithm is another algorithm to find the minimum spanning tree for the given undirected weighted graph. Prim's algorithm is also a greedy algorithm, which is quite ...
GitHub

tszwong/BU-CS-132-Geometric-Algorithms-Notes

These are lecture notes for Computer Science 132, Geometric Algorithms, as taught by me at Boston University. The overall structure of the course is based on Linear Algebra and its Applications, by ...
www.cs.cmu.edu

15-750: Algorithms in the Real World, Spring 2023

Lecturer: Ryan O'Donnell (odonnell@cs). TAs: Liyao Fu (liyaof@andrew), Emre Yolcu (eyolcu@cs), Billy Yan (yunzhouy@andrew). Contacting us: Please use private messages on Piazza instead of emailing the ...
Scientific Research Publishing

A. Acan and Y. Tekol, “Chromosome Reuse in Genetic Algorithms,” Lecture Notes in Computer Science, GECCO 2003, LNCS 2723, Springer-Verlag, Berlin, 2003, pp. 695-705.

ABSTRACT: The Split Delivery Vehicle Routing Problem (SDVRP) allows customers to be assigned to multiple routes. Two hybrid genetic algorithms are developed for the SDVRP and computational results are ...
Scientific Research Publishing

P. Rabanal, I. Rodriguez and F. Rubio, “Using River Formation Dynamics to Design Heuristic Algorithms,” Lecture Notes in Computer Science, Vol. 4618, 2007, pp. 163-177. doi ...

ABSTRACT: Finding optimal solutions to NP-Hard problems requires exponential time with respect to the size of the problem. Consequently, heuristic methods are usually utilized to obtain approximate ...
IEEE

Diophantine Equation and the Euclidean Algorithm: Methods and Philosophy of the Algebraic Approach to Linear Multivariable Control [Lecture Notes]

Abstract: The story behind the Euclidean algorithm and its relationship to the solution of the Diophantine equation is examined in this article. The Euclidean algorithm appears in Proposition 2 in ...