| Page |
Line |
Comment |
| 58 | 14 |
Replace "min" by "max".
|
| 204 | 24 |
One must require $c \ge c'$ in Exercise 6.
|
| 303 | 25-27 |
The full version of the paper by Gabow [1990] appeared in ACM Transactions on Algorithms 14 (2018), Article 39.
|
| 324 | 1-3 |
The full version of the paper by Gabow [1983] appeared in ACM Transactions on Algorithms 14 (2018), Article 39.
|
| 378 | 10 |
The right-hand side of this inequality should be
$\max \{ \sum_{t=(p,A,B)\in T_{i-1}} p x_t \Delta_B, \sum_{t=(p,A,B)\in T_{i-1}} p (1-x_t) \Delta_A \}$.
This is sufficient because either
$\Exp[f(O_{i-1})-f(O_i)] \le x_t \Delta_B$ for all $(p,A,B)\in T_{i-1}$
or
$\Exp[f(O_{i-1})-f(O_i)] \le (1-x_t) \Delta_A$ for all $(p,A,B)\in T_{i-1}$;
see the proof of (14.4).
|
| 379 | 38 |
In Exercise 11, f should be integer-valued.
|
| 381 | 30 |
Replace "$f$ and any $g_C$" by "$g$ and any $f_C$".
|
| 382 | 26-28 |
The paper by Buchbinder and Feldman [2016] appeared in ACM Transactions on Algorithms 14 (2018), Article 14.
|
| 628 | 28-29 |
The paper by Svensson, Tarnawski and Végh [2017] appeared in the
Proceedings of the 50th Annual ACM Symposium on Theory of Computing (2018), pp. 204-213.
|
