Abstract: Minor improvements.

[saga.git] / PLAN

diff --git a/PLAN b/PLAN
index 0bd1e9891d8685d2faa4704e849bb6878305038d..51732fb331fc7803759ef613346fbaae697aedb1 100644 (file)
--- a/PLAN
+++ b/PLAN
@@ -17,70 +17,49 @@
 
   o  Minor-closed classes
   o  Fredman-Tarjan algorithm
-  .  MST verification
-  .  Randomized algorithms
-  .  ?? Chazelle ??
-  .  ?? Pettie ??
+  o  MST verification
+  o  Linear-time verification
+  o  A randomized algorithm
   o  Special cases and related problems
 
-*  Ranking combinatorial objects
+*  Approaching Optimality
+
+  o  Soft heaps
+  o  Robust contractions
+  o  Decision trees
+  o  An optimal algorithm
+
+*  Dynamic MST algorithms
+
+  o  (Semi-)dynamic algorithms
+  o  ET-trees
+  o  Fully dynamic connectivity
+  o  Dynamic MST
+  o  Almost minimum trees
+
+*  Ranking Combinatorial Objects
 
   o  Ranking and unranking
   o  Ranking of permutations
   o  Ranking of k-permutations
   o  Restricted permutations
   o  Hatcheck lady and other derangements
-  .  ?? other objects ??
-  .  ?? general perspective ??
-
-*  Dynamic MST algorithms
-
-  .  (Semi-)dynamic algorithms
-  .  Sleator-Tarjan trees
-  .  ET-trees
-  .  Fully dynamic connectivity
-  .  Semi-dynamic MST
-  .  Fully dynamic MST
 
 TODO:
 
-Spanning trees:
-
-- cite Eisner's tutorial \cite{eisner:tutorial}
-- \cite{pettie:onlineverify} online lower bound
-- mention matroids
-- mention disconnected graphs
-- Some algorithms (most notably Fredman-Tarjan) do not need flattening
-- reference to mixed Boruvka-Jarnik
-- use the notation for contraction by a set
-- practical considerations: katriel:cycle, moret:practice (mention pairing heaps)
-- parallel algorithms: p243-cole (are there others?)
-- bounded expansion classes?
-- restricted cases and arborescences
-- verify: mention our simplifications
+Applications:
 
-Models:
-
-- bit tricks: reference to HAKMEM
-- mention in-place radix-sorting?
-- consequences of Q-Heaps: Thorup's undirected SSSP etc.
-- add more context from thorup:aczero, also mention FP operations
+- degree-restricted cases and arborescences
+- bounded expansion classes?
 
 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 vlstne za matice co splnuji 4.5.2
+  co je to vlastne za matice co splnuji 4.5.2
 - JN: bounded-degree restriction graphs; would it imply general speedup?
 
-Notation:
+Typography:
 
-- G has to be connected, so m=O(n)
-- impedance mismatch in terminology: contraction of G along e vs. contraction of e.
-- use \delta(X) notation
-- unify use of n(G) vs. n
-- use calligraphic letters from ams?
-- change the notation for contractions -- use double slash instead of the dot?
+- formatting of multi-line \algin, \algout