Explore tens of thousands of sets crafted by our community.
Offline Algorithms
3
Flashcards
0/3
Dynamic Programming
Dynamic Programming is an offline algorithm that solves problems by breaking them down into simpler subproblems and storing the results for future use, avoiding redundant computations. In contrast to online algorithms, which make decisions based on current and past information without the opportunity to recompute previous results, offline dynamic programming relies on having complete knowledge of the problem in advance.
Batch Processing
Batch Processing algorithms are offline as they process a group of data items collectively as a batch. The entire data set must be available before processing begins, which differs from an online algorithm that processes each item as it comes without prior knowledge of future items.
Ford-Fulkerson Algorithm for Maximum Flow
The Ford-Fulkerson algorithm is an offline approach used to compute the maximum flow in a flow network. It repeatedly augments the flow along paths from the source to the sink until no augmenting path is left. Contrasting with online algorithms, it cannot adapt to changes while the process is ongoing and requires all the information about the network upfront.
© Hypatia.Tech. 2024 All rights reserved.
