Approximation algorithms for maximum linear arrangement (Q1603380): Difference between revisions

@@ Property / author @@
-Shlomi Rubinstein
@@ Property / author: Shlomi Rubinstein / rank @@
-Normal rank
@@ Property / author @@
+Shlomi Rubinstein
@@ Property / author: Shlomi Rubinstein / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263699
@@ Property / cites work: Q4263699 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4004078
@@ Property / cites work: Q4004078 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximating the maximum quadratic assignment problem
+Normal rank
@@ Property / cites work @@
+Using Homogeneous Weights for Approximating the Partial Cover Problem
+Normal rank
@@ Property / cites work @@
+Divide-and-conquer approximation algorithms via spreading metrics
+Normal rank
@@ Property / cites work @@
+Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
+Normal rank
@@ Property / cites work @@
+A Cut Approach to the Rectilinear Distance Facility Location Problem
+Normal rank
@@ Property / cites work @@
+Q4250184
@@ Property / cites work: Q4250184 / rank @@
+Normal rank
@@ Property / cites work @@
+Obnoxious Facility Location on Graphs
@@ Property / cites work: Obnoxious Facility Location on Graphs / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0020-0190(01)00159-4
+Normal rank
@@ Property / OpenAlex ID @@
+W2060236550
@@ Property / OpenAlex ID: W2060236550 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1603380