Pages that link to "Item:Q4651541"
From MaRDI portal
The following pages link to New Approximation Techniques for Some Linear Ordering Problems (Q4651541):
Displayed 12 items.
- On minimum cost edge searching (Q391138) (← links)
- Revised GRASP with path-relinking for the linear ordering problem (Q411258) (← links)
- On a class of metrics related to graph layout problems (Q603106) (← links)
- An improved approximation ratio for the minimum linear arrangement problem (Q845884) (← links)
- An updated survey on the linear ordering problem for weighted or unweighted tournaments (Q970187) (← links)
- Distributed balanced partitioning via linear embedding (Q2005567) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- \(d\)-dimensional arrangement revisited (Q2444745) (← links)
- Convex Relaxations for Permutation Problems (Q3456867) (← links)
- A New Lower Bound for the Minimum Linear Arrangement of a Graph (Q3503534) (← links)
- Possible and Impossible Attempts to Solve the Treewidth Problem via ILPs (Q5042451) (← links)
- (Q5874519) (← links)