Traffic engineering of management flows by link augmentations on confluent trees

DOI10.1007/s00224-007-9010-0zbMath1153.68315OpenAlexW2164101748MaRDI QIDQ2471695

Baruch Schieber, Tracy Kimbrel, Randeep Bhatia, Joseph (Seffi) Naor, Nicole Immorlica, Vahab S. Mirrokni

Publication date: 18 February 2008

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-007-9010-0

zbMATH Keywords

Dynamic programmingCombinatorial optimizationTraffic engineeringNetwork managementConfluent flowsManagement flows

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Unnamed Item
• An overtraining-resistant stochastic modeling method for pattern recognition
• (Almost) tight bounds and existence theorems for confluent flows
• Meet and merge

This page was built for publication: Traffic engineering of management flows by link augmentations on confluent trees