Optimal oblivious routing in polynomial time (Q5917575): 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.1016/j.jcss.2004.04.010
+Normal rank
@@ Property / OpenAlex ID @@
+W4213272272
@@ Property / OpenAlex ID: W4213272272 / rank @@
+Normal rank
@@ Property / cites work @@
+On-line routing of virtual circuits with applications to load balancing and machine scheduling
+Normal rank
@@ Property / cites work @@
+Routing, merging, and sorting on parallel models of computation
+Normal rank
@@ Property / cites work @@
+Geometric algorithms and combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Tight bounds for oblivious routing in the hypercube
+Normal rank
@@ Property / cites work @@
+Q4002466
@@ Property / cites work: Q4002466 / rank @@
+Normal rank
@@ Property / cites work @@
+Online algorithms. The state of the art
@@ Property / cites work: Online algorithms. The state of the art / rank @@
+Normal rank
@@ Property / cites work @@
+Randomized rounding: A technique for provably good algorithms and algorithmic proofs
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:5917575