Pages that link to "Item:Q6065169"
From MaRDI portal
The following pages link to A (slightly) improved approximation algorithm for metric TSP (Q6065169):
Displaying 37 items.
- A QPTAS for TSP with fat weakly disjoint neighborhoods in doubling metrics (Q650109) (← links)
- Deterministic 7/8-approximation for the metric maximum TSP (Q1034619) (← links)
- An explicit lower bound for TSP with distances one and two (Q1402211) (← links)
- Approximating TSP walks in subcubic graphs (Q2101165) (← links)
- Approximation algorithms for solving the heterogeneous Chinese postman problem (Q2106868) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q2140484) (← links)
- A LP-based approximation algorithm for generalized traveling salesperson path problem (Q2150585) (← links)
- The simultaneous semi-random model for TSP (Q2164675) (← links)
- Bifactor approximation for location routing with vehicle and facility capacities (Q2171591) (← links)
- TSP with bounded metrics (Q2495398) (← links)
- A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← links)
- An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
- Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours (Q2687058) (← links)
- Combinatorial optimization. Abstracts from the workshop held November 7--13, 2021 (hybrid meeting) (Q2693050) (← links)
- On the Complexity of the Metric TSP under Stability Considerations (Q3075531) (← links)
- Deterministic 7/8-Approximation for the Metric Maximum TSP (Q3541791) (← links)
- (Q4535019) (← links)
- Improved Approximation Lower Bounds for TSP with Distances One and Two (Q4784456) (← links)
- A 3/2-Approximation for the Metric Many-Visits Path TSP (Q5055644) (← links)
- On quasisymmetric mappings in semimetric spaces (Q5076532) (← links)
- A $\frac{4}{3}$-Approximation Algorithm for the Minimum 2-Edge Connected Multisubgraph Problem in the Half-Integral Case (Q5096584) (← links)
- An Improved Analysis of the Mömke--Svensson Algorithm for Graph-TSP on Subquartic Graphs (Q5220466) (← links)
- Approximating TSP Solution by MST Based Graph Pyramid (Q5325746) (← links)
- (Q5874556) (← links)
- Improving the approximation ratio for capacitated vehicle routing (Q5925635) (← links)
- Auction algorithm sensitivity for multi-robot task allocation (Q6066800) (← links)
- A 4/3-approximation algorithm for half-integral cycle cut instances of the TSP (Q6086003) (← links)
- From symmetry to asymmetry: generalizing TSP approximations by parametrization (Q6098151) (← links)
- Polyhedral techniques in combinatorial optimization: matchings and tours (Q6118160) (← links)
- Minimizing the maximum flow time in the online food delivery problem (Q6130315) (← links)
- Approximation algorithms for the restricted \(k\)-Chinese postman problems with penalties (Q6181377) (← links)
- The polynomial randomized algorithm to compute bounded degree graph for TSP based on frequency quadrilaterals (Q6535280) (← links)
- Private measures, random walks, and synthetic data (Q6550176) (← links)
- The simultaneous semi-random model for TSP (Q6589752) (← links)
- Improved approximation algorithms for multidepot capacitated vehicle routing (Q6591657) (← links)
- On a traveling salesman problem for points in the unit cube (Q6614116) (← links)
- Approximating minimum \(k\)-tree cover of a connected graph inspired by the multi-ferry routing in delay tolerant networks (Q6629668) (← links)
