Abstract: Minor improvements.

[saga.git] / PLAN

diff --git a/PLAN b/PLAN
index 0f829e047dbf073f4ee7560dff9bcbbe6c6c9d77..51732fb331fc7803759ef613346fbaae697aedb1 100644 (file)
--- a/PLAN
+++ b/PLAN
@@ -35,7 +35,7 @@
   o  ET-trees
   o  Fully dynamic connectivity
   o  Dynamic MST
-  .  Almost minimum trees
+  o  Almost minimum trees
 
 *  Ranking Combinatorial Objects
 
@@ -54,9 +54,7 @@ Applications:
 
 Ranking:
 
-- the general perspective: is it only a technical trick?
 - ranking of permutations on general sets, relationship with integer sorting
-- JN: explain approx scheme
 - JN: 4.5.1:  neslo by preci isolovat nejaky vlstnosti restriction matrices
   tak aby byl speedup? Staci napr predpokladat 4.5.2 (jako to postulovat)
   co je to vlastne za matice co splnuji 4.5.2
@@ -64,11 +62,4 @@ Ranking:
 
 Typography:
 
-* formatting of multi-line \algin, \algout
-- quotes
-- unify names of complexity classes
-
-Global:
-
-- each chapter should make clear in which model we work
-- clean up bibliography
+- formatting of multi-line \algin, \algout