EPISODE · Feb 3, 2020 · 1H 23M
26: Algorithmen II, Vorlesung, WS 2019/20, 28.01.2020
from Algorithmen 2, Vorlesung, WS19/20 · host Prof. Dr. Peter Sanders
26| 0:00:00 Start 0:02:19 The Document Retrieval Problem 0:03:30 Top-k Document Retrieval 0:04:39 Important Query Types 0:05:51 Inverted Indexes 0:09:13 Suffix Arrays 0:11:10 Warmup: Document Listing 0:14:24 Top-k Retrieval 0:15:21 Example 0:21:58 Example Space Usage from [LG17] 0:24:29 Range Minimum Query 0:25:12 2D-Weighted Range Queries 0:34:43 Range Minimum Query Problem 0:49:25 Comparison with other Implementations 0:50:41 (Hyper)Graph Partitioning 0:51:25 Graphs and Hypergraphs 0:54:48 Applications 0:57:08 Successful Heuristic: Multilevel Paradigm 1:09:41 Fiduccia-Mattheyses Algorithm 1:12:28 Adaptive Flow Iterations 1:13:57 Hypergraph Flow Network 1:16:56 Optimized Flow Problem Modeling Approach 1:19:22 Most Balanced Minimum Cut 1:21:10 Experiments: Connectivity Optimization
What this episode covers
26| 0:00:00 Start 0:02:19 The Document Retrieval Problem 0:03:30 Top-k Document Retrieval 0:04:39 Important Query Types 0:05:51 Inverted Indexes 0:09:13 Suffix Arrays 0:11:10 Warmup: Document Listing 0:14:24 Top-k Retrieval 0:15:21 Example 0:21:58 Example Space Usage from [LG17] 0:24:29 Range Minimum Query 0:25:12 2D-Weighted Range Queries 0:34:43 Range Minimum Query Problem 0:49:25 Comparison with other Implementations 0:50:41 (Hyper)Graph Partitioning 0:51:25 Graphs and Hypergraphs 0:54:48 Applications 0:57:08 Successful Heuristic: Multilevel Paradigm 1:09:41 Fiduccia-Mattheyses Algorithm 1:12:28 Adaptive Flow Iterations 1:13:57 Hypergraph Flow Network 1:16:56 Optimized Flow Problem Modeling Approach 1:19:22 Most Balanced Minimum Cut 1:21:10 Experiments: Connectivity Optimization
NOW PLAYING
26: Algorithmen II, Vorlesung, WS 2019/20, 28.01.2020
No transcript for this episode yet
Similar Episodes
Feb 24, 2026 ·13m
Feb 17, 2026 ·9m
Feb 11, 2026 ·7m
Feb 4, 2026 ·18m
Feb 3, 2026 ·7m
Jan 27, 2026 ·8m