Minimizing maximum fiber requirement in optical networks
From MaRDI portal
Publication:2581759
Recommendations
Cites work
- Efficient routing in all-optical networks
- Global wire routing in two-dimensional arrays
- scientific article; zbMATH DE number 1003273 (Why is no real title available?)
- scientific article; zbMATH DE number 4027472 (Why is no real title available?)
- scientific article; zbMATH DE number 1303573 (Why is no real title available?)
- scientific article; zbMATH DE number 1306887 (Why is no real title available?)
- scientific article; zbMATH DE number 734955 (Why is no real title available?)
- scientific article; zbMATH DE number 1182769 (Why is no real title available?)
- scientific article; zbMATH DE number 1962808 (Why is no real title available?)
- scientific article; zbMATH DE number 2038727 (Why is no real title available?)
- scientific article; zbMATH DE number 2079419 (Why is no real title available?)
- scientific article; zbMATH DE number 1754632 (Why is no real title available?)
- scientific article; zbMATH DE number 6472619 (Why is no real title available?)
- Optimal wavelength routing on directed fiber trees
- Randomized rounding: A technique for provably good algorithms and algorithmic proofs
- Resource allocation problems in multifiber WDM tree networks.
- Routing and path multicoloring
- Zero knowledge and the chromatic number
Cited in
(6)- Minimum multiplicity edge coloring via orientation
- Path multicoloring in spider graphs with even color multiplicity
- Optimizing splitter and fiber location in a multilevel optical FTTH network
- Inapproximability results for wavelength assignment in WDM optical networks
- Automata, Languages and Programming
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
This page was built for publication: Minimizing maximum fiber requirement in optical networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2581759)