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 5 items.
- (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)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)
