The following pages link to TSP with bounded metrics (Q2495398):
Displaying 11 items.
- On testing Hamiltonicity of graphs (Q468434) (← links)
- New inapproximability bounds for TSP (Q494069) (← links)
- Improved integrality gap upper bounds for traveling salesperson problems with distances one and two (Q1754106) (← links)
- Efficient PTAS for the maximum traveling salesman problem in a metric space of fixed doubling dimension (Q2162693) (← links)
- An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles (Q2185648) (← links)
- Bipartite multigraphs with expander-like properties (Q2381530) (← links)
- Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies (Q2947865) (← links)
- Approximation hardness of graphic TSP on cubic graphs (Q3194690) (← links)
- Approximation bounds for Black Hole Search problems (Q3548722) (← links)
- Unconstrained traveling tournament problem is APX-complete (Q6047703) (← links)
- Scheduling on a graph with release times (Q6204662) (← links)
