Pages that link to "Item:Q2773025"
From MaRDI portal
The following pages link to On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem (Q2773025):
Displaying 9 items.
- On approximability of linear ordering and related NP-optimization problems on graphs. (Q1427183) (← links)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- Domination chain: characterisation, classical complexity, parameterised complexity and approximability (Q2181241) (← links)
- On the hardness of approximating some NP-optimization problems related to minimum linear ordering problem (Q2773025) (← links)
- On the Complexity Landscape of the Domination Chain (Q2795935) (← links)
- On approximability of linear ordering and related NP-optimization problems on graphs (extended abstract) (Q2816031) (← links)
- On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems (Q2851846) (← links)
- Approximating Minimum Linear Ordering Problems (Q3167397) (← links)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)