The communication network algorithms course provides the methodologies and algorithms used for designing and optimizing communications networks with focus on the algorithmic aspects of network design. Topics include modeling networks as graphs, graph algorithms for finding minimum spanning trees, shortest paths, and matroids, topological design including selecting terminal concentrator locations, heuristic algorithms and network topology optimization, algorithms including flow deviation algorithm, Bertsekas-Gallager algorithm, cut-saturation algorithm for distributed computer systems, communications network optimization involving cut saturation algorithm for topological design of packet switched, communication networks algorithm for access facility location problem, dimensioning schemes, mesh topology optimization including capacity assignment and branch exchange, mesh network topology optimization and routing algorithm.