In Algorithm A3, restate the quick-accept bound X2 ≤ 4(1 + log c) − 4cU and determine the boundary and area of the quick-accept region of the (u, v)-plane. Show that this region has maximum area when...

In Algorithm A3, restate the quick-accept bound X2 ≤ 4(1 + log c) − 4cU and determine the boundary and area of the quick-accept region of the (u, v)-plane. Show that this region has maximum area when c = e1/4.

Devise simpler bounds v∗ +, v∗ − (or use the maximum) and derive a non-setup version for Algorithm C3. Compare its performance.