Pages that link to "Item:Q2748380"
From MaRDI portal
The following pages link to On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality (Q2748380):
Displaying 25 items.
- Constant factor approximation algorithm for TSP satisfying a biased triangle inequality (Q346242) (← links)
- Symmetric connectivity with directional antennas (Q364844) (← links)
- Improved approximations for TSP with simple precedence constraints (Q396660) (← links)
- Approximating the metric TSP in linear time (Q649110) (← links)
- On the hardness of constructing minimal 2-connected spanning subgraphs in complete graphs with sharpened triangle inequality (Q703542) (← links)
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality (Q866548) (← links)
- On the relationship between ATSP and the cycle cover problem (Q868952) (← links)
- On \(k\)-connectivity problems with sharpened triangle inequality (Q1002105) (← links)
- Towards the notion of stability of approximation for hard optimization tasks and the traveling salesman problem. (Q1608333) (← links)
- Approximability and inapproximability of the star \(p\)-hub center problem with parameterized triangle inequality (Q1678171) (← links)
- Relaxed triangle inequality ratio of the Sørensen-Dice and Tversky indexes (Q1705776) (← links)
- Methods for solving fuzzy assignment problems and fuzzy travelling salesman problems with different membership functions (Q1933544) (← links)
- A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality (Q2009011) (← links)
- On the approximability of the single allocation \(p\)-hub center problem with parameterized triangle inequality (Q2149101) (← links)
- Approximation algorithms for the \(p\)-hub center routing problem in parameterized metric graphs (Q2285135) (← links)
- An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality (Q2353642) (← links)
- Approximate spanning cactus (Q2353648) (← links)
- The minimum-area spanning tree problem (Q2432736) (← links)
- On the Approximation Ratio of the Path Matching Christofides Algorithm (Q2891381) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Improved approximations for ordered TSP on near-metric graphs (Q5248874) (← links)
- On the Complexity of the Star p-hub Center Problem with Parameterized Triangle Inequality (Q5283364) (← links)
- Solving nonlinear and dynamic programming equations on extended \(b\)-metric spaces with the fixed-point technique (Q6103683) (← links)
- On a traveling salesman problem for points in the unit cube (Q6614116) (← links)
- On the general position number of the <i>k</i> -th power graphs (Q6648815) (← links)
