-
Notifications
You must be signed in to change notification settings - Fork 5
/
todo
100 lines (78 loc) · 2.21 KB
/
todo
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
Document improvements:
front page
consistent margins
fill in descriptions everywhere
number of lines in listings!!
a somewhat more appealing layout?
separate section and listings chapter contents
codelisting headers
oversea TeX markup. especially, add \note!
Content improvements: (by chapter)
Test programs in document!
Contest
Problem assessment sheet
Checklist (as in algomanual "How to design algorithms")
check kylix specific!
c-lite?/script!
Datastructures
STL and complex descriptions?
Sign, rational, bigint descriptions
BigInt!!
unify bigint, more functionality in separate files,
binops, move extra implementations to obsolete
suffix tree
kd tree, tries?
Number Theory
Dynamic josephus
More linalg.? matrix factorisation?
Linear programming!! Mattias har skrivit
DFT?
Determinant, Permanent (Matrixmult?)
Combinatorial
generating: subsets, partitions, graphs ; calendrical ; job sched.
numerical golden search
root finding? (as in last contest)
knapsack is here, to hard
Graph
(algo manual har mst före s-p!)
chinese postman?
finding min cut edges?
cost flows!!
Planarity detection?
more for_edge functional routines
flow constructions: the actual constructions
Transportation algorithm \
Simplex-on-a-graph -Mattias tittar på det
Geometry
a.dot(b) instead of dot(a, b)!
Structure the interval and ccw stuff
Triangulation?
Range search?
Point location?
Polygon partitioning?
Maintaining line arrangements?
Some textbook geometry results!! (cross product? finding the xx point..)
Sweeping pendulum! (from nwerc)
Pattern
Longest common subsequence
Shortest common superstring
Pattern discovery .. ?
Game Theory!!!
Hard Problems
Knapsack should be here
satisfiability..?
In/out
graph input away
more paradigms?
Additions:
Optimisation: linear programming
Poker hands
Simple algorithms!!
Cryptography?
(commented-out of lib.pdf:)
Parsing (LALR/SLR?), Hard Problems (more heuristics!), Idioms!!,
Calendrical, Time table
Something on dynamic programming!! examples? general considerations?
Extract useful methods and concepts from old problems!
(browse old problem descriptions to find topics)
Testing!!