Pages that link to "Item:Q1402211"
From MaRDI portal
The following pages link to An explicit lower bound for TSP with distances one and two (Q1402211):
Displaying 9 items.
- Lower and upper competitive bounds for online directed graph exploration (Q343923) (← links)
- An explicit bound on the transportation cost distance (Q380692) (← links)
- New inapproximability bounds for TSP (Q494069) (← links)
- An approximation algorithm for the minimum co-path set problem (Q547306) (← links)
- Weighted amplifiers and inapproximability results for travelling salesman problem (Q2156301) (← links)
- TSP with bounded metrics (Q2495398) (← links)
- Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies (Q2947865) (← links)
- Sequentially Swapping Colored Tokens on Graphs (Q4622769) (← links)
- Improved Approximation Lower Bounds for TSP with Distances One and Two (Q4784456) (← links)