Pages that link to "Item:Q845884"
From MaRDI portal
The following pages link to An improved approximation ratio for the minimum linear arrangement problem (Q845884):
Displaying 20 items.
- On a binary distance model for the minimum linear arrangement problem (Q458974) (← links)
- On a class of metrics related to graph layout problems (Q603106) (← links)
- \(\ell ^2_2\) spreading metrics for vertex ordering problems (Q848848) (← links)
- Low-light trees, and tight lower bounds for Euclidean spanners (Q972609) (← links)
- Approximation algorithms for maximum linear arrangement (Q1603380) (← links)
- Distributed balanced partitioning via linear embedding (Q2005567) (← links)
- On an ordering problem in weighted hypergraphs (Q2115861) (← links)
- Demand-aware network designs of bounded degree (Q2189175) (← links)
- \(d\)-dimensional arrangement revisited (Q2444745) (← links)
- Improved approximation algorithms for the Min-Max selecting items problem (Q2445242) (← links)
- (Q2753931) (← links)
- Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues (Q3167406) (← links)
- Minimum Linear Arrangement of Series-Parallel Graphs (Q3453293) (← links)
- Convex Relaxations for Permutation Problems (Q3456867) (← links)
- A New Lower Bound for the Minimum Linear Arrangement of a Graph (Q3503534) (← links)
- A variation on the min cut linear arrangement problem (Q3785979) (← links)
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut (Q5009512) (← links)
- Ordering a Sparse Graph to Minimize the Sum of Right Ends of Edges (Q5041192) (← links)
- Bounds on the Geometric Mean of Arc Lengths for Bounded-Degree Planar Graphs (Q5321706) (← links)
- Hardness and approximation of submodular minimum linear ordering problems (Q6634527) (← links)
