Pages that link to "Item:Q1603380"
From MaRDI portal
The following pages link to Approximation algorithms for maximum linear arrangement (Q1603380):
Displaying 8 items.
- On a binary distance model for the minimum linear arrangement problem (Q458974) (← links)
- An improved approximation ratio for the minimum linear arrangement problem (Q845884) (← links)
- Parameterized algorithmics for linear arrangement problems (Q1003461) (← links)
- A new rounding procedure for the assignment problem with applications to dense graph arrangement problems (Q1600093) (← links)
- Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues (Q3167406) (← links)
- (Q3471873) (← links)
- Bounds of the sum of edge lengths in linear arrangements of trees (Q5857519) (← links)
- The maximum linear arrangement problem for trees under projectivity and planarity (Q6072193) (← links)