Pages that link to "Item:Q494069"
From MaRDI portal
The following pages link to New inapproximability bounds for TSP (Q494069):
Displaying 26 items.
- Approximation algorithms for the bus evacuation problem (Q724742) (← links)
- On global integer extrema of real-valued box-constrained multivariate quadratic functions (Q1680502) (← links)
- Constant factor approximation for ATSP with two edge weights (Q1801010) (← links)
- Vehicle routing with subtours (Q2010917) (← links)
- Approximating TSP walks in subcubic graphs (Q2101165) (← links)
- Approximation algorithms for some extensions of the maximum profit routing problem (Q2105889) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q2140484) (← links)
- Weighted amplifiers and inapproximability results for travelling salesman problem (Q2156301) (← links)
- The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (Q2191772) (← links)
- Approximation algorithms for some min-max postmen cover problems (Q2241210) (← links)
- Hard to solve instances of the Euclidean traveling salesman problem (Q2246186) (← links)
- Traveling salesman problem across well-connected cities and with location-dependent edge lengths (Q2274794) (← links)
- Constant Factor Approximation for ATSP with Two Edge Weights (Q3186505) (← links)
- The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (Q4577740) (← links)
- Semidefinite Programming Relaxations of the Traveling Salesman Problem and Their Integrality Gaps (Q5076689) (← links)
- Characterizing the Integrality Gap of the Subtour LP for the Circulant Traveling Salesman Problem (Q5206234) (← links)
- Reducing Path TSP to TSP (Q5860476) (← links)
- An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem (Q5863328) (← links)
- Travelling on graphs with small highway dimension (Q5925522) (← links)
- Perpetual maintenance of machines with different urgency requirements (Q6078292) (← links)
- On approximate data reduction for the Rural Postman Problem: Theory and experiments (Q6092640) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q6098151) (← links)
- Scheduling on a graph with release times (Q6204662) (← links)
- Twenty-two new approximate proof labeling schemes (Q6535018) (← links)
- Private measures, random walks, and synthetic data (Q6550176) (← links)
- On \(\lambda\)-backbone coloring of cliques with tree backbones in linear time (Q6595513) (← links)
