An inverse model for the most uniform problem (Q924880): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.orl.2007.03.006
+Normal rank
@@ Property / OpenAlex ID @@
+W2148448963
@@ Property / OpenAlex ID: W2148448963 / rank @@
+Normal rank
@@ Property / cites work @@
+Most and least uniform spanning trees
@@ Property / cites work: Most and least uniform spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Slowing down sorting networks to obtain faster sorting algorithms
+Normal rank
@@ Property / cites work @@
+On finding most uniform spanning trees
@@ Property / cites work: On finding most uniform spanning trees / rank @@
+Normal rank
@@ Property / cites work @@
+Balanced optimization problems
@@ Property / cites work: Balanced optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial Optimization with Rational Objective Functions
+Normal rank
@@ Property / cites work @@
+Applying Parallel Computation Algorithms in the Design of Serial Algorithms
+Normal rank
@@ Property / cites work @@
+Constrained balanced optimization problems
@@ Property / cites work: Constrained balanced optimization problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q2743974
@@ Property / cites work: Q2743974 / rank @@
+Normal rank
@@ Property / cites work @@
+A class of inverse dominant problems under weighted \(l_{\infty }\) norm and an improved complexity bound for Radzik's algorithm
+Normal rank
@@ Property / cites work @@
+An Oracle Strongly Polynomial Algorithm for Bottleneck Expansion Problems
+Normal rank