An improved approximation ratio for the minimum linear arrangement problem (Q845884): Difference between revisions

@@ Property / cites work @@
+Euclidean distortion and the sparsest cut
@@ Property / cites work: Euclidean distortion and the sparsest cut / rank @@
+Normal rank
@@ Property / cites work @@
+Expander flows, geometric embeddings and graph partitioning
+Normal rank
@@ Property / cites work @@
+<i>l</i><sup>2</sup><sub>2</sub> spreading metrics for vertex ordering problems
+Normal rank
@@ Property / cites work @@
+Q2921658
@@ Property / cites work: Q2921658 / rank @@
+Normal rank
@@ Property / cites work @@
+Divide-and-conquer approximation algorithms via spreading metrics
+Normal rank
@@ Property / cites work @@
+Excluded minors, network decomposition, and multicommodity flow
+Normal rank
@@ Property / cites work @@
+Q2921657
@@ Property / cites work: Q2921657 / rank @@
+Normal rank
@@ Property / cites work @@
+New Approximation Techniques for Some Linear Ordering Problems
+Normal rank