Next: MINIMUM BEND NUMBER Up: Miscellaneous Previous: MAXIMUM K-FACILITY LOCATION Index

### MINIMUM K-SWITCHING NETWORK

- INSTANCE: Complete graph and distances satisfying the triangle inequality.

- SOLUTION: A partition of V.

- MEASURE: Maximum distance between vertices in different sets with the same index, i.e.,

- Good News: Approximable within 3 [237].

- Bad News: Not approximable within 2 for any [237].