##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
##### ###### ##### ### # # ### # # ###### ## ## ## ## ## ## ## # # # # # ## ##### #### ##### # # # # # # # #### ## # ## ## ## ## # # # # # ## ## # ###### ## ### # ### # ######
Line breaking optimization
Given words with lengths and line width . find the lowest sum of (trailing space)^3 for all lines except the last. = min cost to arrange words to .
Transition: where is cube of spaces. The cube cost penalizes uneven lines heavily. QI can be shown to hold for this cost. Apply D&C improvement: instead of . This is it behind TeX's line breaking.
