Pages that link to "Item:Q1606928"
From MaRDI portal
The following pages link to On the approximation hardness of dense TSP and other path problems (Q1606928):
Displaying 6 items.
- On the \({\mathcal {H}}\)-free extension complexity of the TSP (Q519756) (← links)
- Hardness of fully dense problems (Q2643075) (← links)
- (Q4535019) (← links)
- New Approximation Algorithms for (1,2)-TSP (Q5002675) (← links)
- A Polynomial-Time Algorithm to Determine (Almost) Hamiltonicity of Dense Regular Graphs (Q5084096) (← links)
- Hardness of Approximation Results for the Problem of Finding the Stopping Distance in Tanner Graphs (Q5385974) (← links)