Algorithm Report Guide

Example research topics:

1. Optimizing Shortest Path Algorithms for Large-Scale Graphs

Investigate and compare the performance of Dijkstra’s algorithm, A*, and

Bellman-Ford on large graphs, focusing on time complexity and real-world
applications like GPS navigation.

Reference:

Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C.

(2009). Introduction to Algorithms (3rd ed.). MIT Press (Chapter 24
discusses Dijkstra’s algorithm, Bellman-Ford, and other shortest path
algorithms, with insights into their applications in large graphs.).

Sanders, P., & Schulz, C. (2020). "Scalable Graph Algorithms."

In Encyclopedia of Parallel Computing. Springer.

2. Comparative Analysis of Sorting Algorithms for Big Data

Analyze the efficiency of Quick Sort, Merge Sort, and Tim Sort when
handling massive datasets, considering memory usage and scalability.

Reference:

Knuth, D. E. (1998). The Art of Computer Programming, Volume 3:

Sorting and Searching (2nd ed.). Addison-Wesley.

Goodrich, M. T., & Tamassia, R. (2021). Algorithm Design and

Applications (2nd ed.). Wiley.

3. Dynamic Programming for the Traveling Salesman Problem

Explore dynamic programming approaches to solve the Traveling

Salesman Problem and compare their performance with heuristic methods.

Reference:

Bellman, R. (1962). "Dynamic Programming Treatment of the Travelling

Salesman Problem." Journal of the ACM, 9(1), 61-63.

Algorithm Report Guide 1

 Hougardy, S., & Zhong, X. (2021). "Approximation Algorithms for the
Traveling Salesman Problem." Mathematical Programming, 187(1), 1-
29.

4. String Matching Algorithms in Bioinformatics

Study the application of KMP and Boyer-Moore algorithms for DNA

sequence matching, evaluating their speed and accuracy.

Reference:

Gusfield, D. (1997). Algorithms on Strings, Trees, and Sequences:

Computer Science and Computational Biology. Cambridge University
Press.

Navarro, G. (2020). "Modern String Algorithms for Big Data." ACM

Computing Surveys, 53(4), 1-37.

5. Greedy Algorithms for Resource Scheduling

Design and implement a greedy algorithm for task scheduling in cloud

computing, analyzing its effectiveness compared to optimal solutions.

Reference:

Kleinberg, J., & Tardos, É. (2005). Algorithm Design. Addison-Wesley.

Blazewicz, J., Ecker, K., Pesch, E., Schmidt, G., Sterna, M., & Weglarz,
J. (2019). Handbook on Scheduling: From Theory to Practice (2nd ed.).
Springer.

6. Graph Coloring Algorithms for Network Optimization

Investigate graph coloring techniques (e.g., Welsh-Powell algorithm) to

optimize resource allocation in wireless networks.

Reference:

Welsh, D. J. A., & Powell, M. B. (1967). "An upper bound for the
chromatic number of a graph and its application to timetabling
problems." The Computer Journal, 10(1), 85-86.

Gavoille, C., & Peleg, D. (2022). "Distributed Graph Coloring:

Foundations, Models, and Algorithms." Theoretical Computer Science,
917, 1-22.

Algorithm Report Guide 2

 7. Parallel Algorithms for Matrix Multiplication

Research parallel implementations of Strassen’s algorithm versus standard

matrix multiplication, focusing on speedup and scalability on multi-core
systems.

Reference:

Strassen, V. (1969). "Gaussian elimination is not optimal." Numerische

Mathematik, 13(4), 354-356.

Ballard, G., Druinsky, A., Knight, N., & Schwartz, O. (2020).

"Hypergraph Partitioning for Parallel Matrix Multiplication." SIAM
Journal on Scientific Computing, 42(5), C241-C266.

8. Approximation Algorithms for NP-Hard Problems

Study approximation algorithms for the Vertex Cover problem, analyzing

their approximation ratios and practical performance.

Reference:

Williamson, D. P., & Shmoys, D. B. (2023). The Design of

Approximation Algorithms (Updated ed.). Cambridge University Press.

9. Divide and Conquer Strategies in Image Processing

Apply divide-and-conquer techniques (e.g., Fast Fourier Transform) to

optimize image compression algorithms, evaluating quality and speed
trade-offs.

Reference:

Pratt, W. K. (2019). Introduction to Digital Image Processing (2nd ed.).

CRC Press.

10. Randomized Algorithms for Load Balancing

Explore randomized algorithms for load balancing in distributed systems,

comparing their performance with deterministic approaches in terms of
fairness and efficiency.

Reference:

Algorithm Report Guide 3

 Molla, A. R., & Pandurangan, G. (2021). "Randomized Algorithms for
Distributed Load Balancing." Journal of Parallel and Distributed
Computing, 151, 83-94.

Standard Evaluation Reports

Criteria Description

- Logical flow, clear introduction, body, and conclusion.

Proper headings.
Clarity & Structure
- Grammar, spelling, and readability. Proper citations
(IEEE/APA format).

Uses credible sources (academic papers, books, reputable

Depth of Research
websites).

Technical Accuracy Correctly explains concepts without major errors.

Connects the topic to computer systems and computer

Relevance to Course
science (hardware, software, architecture, etc.).

Presentation Well-formatted, includes diagrams/tables if needed.

Download paper and books

scholar.google.com

https://sci-hub.se

https://paperpanda.app/search

Algorithm Report Guide 4