Flow Trees: A Lower Bound Computation Tool with Applications to Rearrangeable Multihop Lightwave Network Optimization

Bülent Yener, Terrance E. Boult. Flow Trees: A Lower Bound Computation Tool with Applications to Rearrangeable Multihop Lightwave Network Optimization. J. High Speed Networks, 4(1):99-113, 1995. [doi]

@article{YenerB95,
  title = {Flow Trees: A Lower Bound Computation Tool with Applications to Rearrangeable Multihop Lightwave Network Optimization},
  author = {Bülent Yener and Terrance E. Boult},
  year = {1995},
  doi = {10.3233/JHS-1995-4107},
  url = {http://dx.doi.org/10.3233/JHS-1995-4107},
  researchr = {https://researchr.org/publication/YenerB95},
  cites = {0},
  citedby = {0},
  journal = {J. High Speed Networks},
  volume = {4},
  number = {1},
  pages = {99-113},
}