Next: MINIMUM SORTING BY REVERSALS
Previous: MINIMUM SIZE ULTRAMETRIC TREE
Rectangle R and finite set P of points located inside R.
A set of line segments that partition R into rectangles such that
every point in P is on the boundary of some rectangle.
The total length of the introduced line segments.
- Good News:
Approximable within 1.75 .
Variation in which R is a rectilinear polygon is approximable within 4