Pages that link to "Item:Q3167397"
From MaRDI portal
The following pages link to Approximating Minimum Linear Ordering Problems (Q3167397):
Displaying 10 items.
- An improved approximation ratio for the minimum linear arrangement problem (Q845884) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem (Q2773025) (← links)
- Approximation Guarantees for the Minimum Linear Arrangement Problem by Higher Eigenvalues (Q3167406) (← links)
- (Q3626415) (← links)
- (Q4250184) (← links)
- A General Framework for Approximating Min Sum Ordering Problems (Q5087715) (← links)
- On Submodular Search and Machine Scheduling (Q5108249) (← links)
- Hardness and approximation of submodular minimum linear ordering problems (Q6634527) (← links)
- On min sum vertex cover and generalized min sum set cover (Q6663094) (← links)