All public logs

Combined display of all available logs of Algorithm Wiki. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

• 10:31, 15 February 2023 Admin talk contribs created page Melhorn's Approximation algorithm (Approximate OBST Optimal Binary Search Trees) (Created page with "== Time Complexity == $O(n)$ == Space Complexity == $O(n)$ (https://people.mpi-inf.mpg.de/~mehlhorn/ftp/mehlhorn3.pdf, storing left/right subtrees' weights) == Description == == Approximate? == Approximate Approximation Factor: 0.63 H \leq P_opt \leq P_balanced \leq 2 + 1.44 H == Randomized? == No, deterministic == Model of Computation == == Year == 1975 == Reference == https://people.mpi-inf.mpg.de/~mehlhorn/ftp/mehlhorn3.pdf")