Maximum Throughput Network Routing Subject to Fair Flow Allocation (Q3195309): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-09174-7_1
+Normal rank
@@ Property / OpenAlex ID @@
+W102903495
@@ Property / OpenAlex ID: W102903495 / rank @@
+Normal rank
@@ Property / cites work @@
+Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs
+Normal rank
@@ Property / cites work @@
+Q3361866
@@ Property / cites work: Q3361866 / rank @@
+Normal rank
@@ Property / cites work @@
+Upward Max-Min Fairness
@@ Property / cites work: Upward Max-Min Fairness / rank @@
+Normal rank
@@ Property / cites work @@
+The directed subgraph homeomorphism problem
@@ Property / cites work: The directed subgraph homeomorphism problem / rank @@
+Normal rank
@@ Property / cites work @@
+Fairness in routing and load balancing
@@ Property / cites work: Fairness in routing and load balancing / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal flows in networks with multiple sources and sinks
+Normal rank
@@ Property / cites work @@
+Max-min fairness in multi-commodity flows
@@ Property / cites work: Max-min fairness in multi-commodity flows / rank @@
+Normal rank
@@ Property / cites work @@
+Lexicographic maximin optimisation for fair bandwidth allocation in computer networks
+Normal rank