Minimum status of trees with a given degree sequence

The minimum status (or its normalized version called proximity) is a well-known concept in communication network theory. We determine the trees minimizing the minimum status among trees with a given degree sequence, and we show that the trees maximizing the minimum status among trees with a given degree sequence must be caterpillars with specific properties.