OSPF routing with optimal oblivious performance ratio under polyhedral demand uncertainty (Q374694): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+B18
@@ Property / Mathematics Subject Classification ID: 90B18 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+B20
@@ Property / Mathematics Subject Classification ID: 90B20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+K10
@@ Property / Mathematics Subject Classification ID: 65K10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6218679
@@ Property / zbMATH DE Number: 6218679 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+OSPF
@@ Property / zbMATH Keywords: OSPF / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+oblivious routing
@@ Property / zbMATH Keywords: oblivious routing / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+traffic engineering
@@ Property / zbMATH Keywords: traffic engineering / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+ECMP
@@ Property / zbMATH Keywords: ECMP / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+branch-and-price
@@ Property / zbMATH Keywords: branch-and-price / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+traffic uncertainty
@@ Property / zbMATH Keywords: traffic uncertainty / rank @@
+Normal rank

Revision as of 11:17, 29 June 2023