University of Sydney, Australia
https://sites.google.com/view/tao25workshop/home
Registration deadline: December 1, 2025 (AOE)
This is a free 2-day workshop, right after FOCS 2025, to discuss recent advances in approximation and online algorithms for
network design and related areas. This is the 10th iteration of the Flexible Network Design workshop series (see
https://www.cs.umd.edu/fnd2018 for the previous iteration).
The workshop will have a mix of talks---including two plenary talks by MohammadTaghi Hajiaghayi on beating 2-approximation for Steiner forest, and Jarek
Byrka on recent advances on bidirected cut relaxations---as well as a Wiki Edit-A-Thon and an Open Problem Session.
Students, faculty, and researchers of all seniority levels are welcome.
Organizers:
Julian Mestre, University of Sydney
R. Ravi, CMU
William Umboh, University of Melbourne
**********************************************************
*
* Contributions to be spread via DMANET are submitted to
*
* DMANET@zpr.uni-koeln.de
*
* Replies to a message carried on DMANET should NOT be
* addressed to DMANET but to the original sender. The
* original sender, however, is invited to prepare an
* update of the replies received and to communicate it
* via DMANET.
*
* DISCRETE MATHEMATICS AND ALGORITHMS NETWORK (DMANET)
* http://www.zaik.uni-koeln.de/AFS/publications/dmanet/
*
**********************************************************