Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A minimum interference routing algorithm with reduced computational complexity

From MaRDI portal
Publication:2507263
Jump to:navigation, search

DOI10.1016/j.comnet.2005.06.015zbMath1103.68323OpenAlexW2084445615MaRDI QIDQ2507263

Gustavo B. Figueiredo, Nelson L. S. Da Fonseca, José Augusto Suruagy Monteiro

Publication date: 10 October 2006

Published in: Computer Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.comnet.2005.06.015


zbMATH Keywords

traffic engineeringMPLSminimum interference routing


Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Network design and communication in computer systems (68M10)








This page was built for publication: A minimum interference routing algorithm with reduced computational complexity

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2507263&oldid=15220909"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 03:06.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki