Learn More
We introduce a class of incremental network design problems focused on investigating the optimal choice and timing of network expansions. We concentrate on an incremental network design problem with shortest paths. We investigate structural properties of optimal solutions, we show that the simplest variant is NP-hard, we analyze the worst-case performance(More)
Acknowledgements This report reflects the work of many individuals and organizations, and could not have been accomplished without their contributions. We thank the National Campaign for the Fair Sentencing of Youth, The Sentencing Project, the ACLU of Michigan, and Human Rights Watch for their research and commitment to protecting the human rights of youth(More)
  • 1