Uncategorized pages
Jump to navigation
Jump to search
Showing below up to 20 results in range #1 to #20.
View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)
- $(\min, \leq)$ Product
- $O(n\log n)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)
- $O(n^2)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)
- $O(n^3)$ Dynamic Programming (Weighted Activity Selection Problem Interval Scheduling)
- $\delta$-Triangle Conjecture
- (3-Dimensional, i.e. project onto a 2D plane)
- (5/3)-approximate ap-shortest paths
- (Boolean Matrix Multiplication (Combinatorial) Matrix Product)
- ( Negative Triangle)
- (many more...) (2-dimensional Convex Hull, Dynamic Convex Hull)
- 0-1 Linear Programming
- 1-in-3SAT
- 1-sensitive (3/2)-approximate ss-shortest paths
- 1-sensitive (4/3)-approximate decremental diameter
- 1-sensitive (4/3)-approximate decremental eccentricity
- 1-sensitive decremental diameter
- 1-sensitive decremental st-shortest paths
- 1-sensitive incremental ss-reach
- 1D Maximum Subarray
- 2-Dimensional Poisson Problem