Pages that link to "Item:Q1180833"
From MaRDI portal
The following pages link to Analysis of Christofides' heuristic: some paths are more difficult than cycles (Q1180833):
Displaying 50 items.
- GRASP with path relinking for the symmetric Euclidean clustered traveling salesman problem (Q336743) (← links)
- Constant factor approximation algorithm for TSP satisfying a biased triangle inequality (Q346242) (← links)
- Routing open shop and flow shop scheduling problems (Q421573) (← links)
- The traveling salesman problem with flexible coloring (Q444446) (← links)
- An improved approximation algorithm for the clustered traveling salesman problem (Q456175) (← links)
- Shorter tours by nicer ears: \(7/5\)-approximation for the graph-TSP, \(3/2\) for the path version, and \(4/3\) for two-edge-connected subgraphs (Q484552) (← links)
- Finding an approximate minimum-link visibility path inside a simple polygon (Q672401) (← links)
- Approximation algorithms for multiple terminal, Hamiltonian path problems (Q691412) (← links)
- Approximation algorithms for the maximum Hamiltonian path problem with specified endpoint(s) (Q706963) (← links)
- Cooperative TSP (Q982655) (← links)
- A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids (Q1035684) (← links)
- A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems (Q1306365) (← links)
- Tour recommendation for groups (Q1741326) (← links)
- Better \(s-t\)-tours by Gao trees (Q1800996) (← links)
- A 4-approximation algorithm for the TSP-path satisfying a biased triangle inequality (Q2009011) (← links)
- Vehicle routing with subtours (Q2010917) (← links)
- Approximating the multiple-depot multiple-terminal Hamiltonian path problem (Q2010925) (← links)
- Approximation algorithms for general cluster routing problem (Q2019492) (← links)
- Approximation algorithms with constant ratio for general cluster routing problems (Q2084625) (← links)
- Approximation algorithms for the \(k\)-depots Hamiltonian path problem (Q2128771) (← 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 median routing problem for simultaneous planning of emergency response and non-emergency jobs (Q2183877) (← links)
- \(\frac{13}{9}\)-approximation for graphic TSP (Q2254507) (← links)
- \(\frac 32\)-approximation algorithm for two variants of a 2-depot Hamiltonian path problem (Q2270326) (← links)
- An improved upper bound on the integrality ratio for the \(s\)-\(t\)-path TSP (Q2294304) (← links)
- Approximating minimum-cost connected \(T\)-joins (Q2345942) (← links)
- What would Edmonds do? Augmenting paths and witnesses for degree-bounded MSTs (Q2391179) (← links)
- A note on approximation algorithms of the clustered traveling salesman problem (Q2398506) (← links)
- An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem (Q2408163) (← links)
- Approximation algorithms for the traveling repairman and speeding deliveryman problems (Q2428683) (← links)
- An LP-based \(\frac{3}{2}\)-approximation algorithm for the \(s-t\) path graph traveling salesman problem (Q2450741) (← links)
- Traveling salesman path problems (Q2476987) (← links)
- Slightly improved upper bound on the integrality ratio for the \(s - t\) path TSP (Q2661533) (← links)
- Improving on best-of-many-Christofides for \(T\)-tours (Q2661569) (← links)
- The hierarchical Chinese postman problem: the slightest disorder makes it hard, yet disconnectedness is manageable (Q2661637) (← links)
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems (Q2676463) (← links)
- An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
- A 3/2-Approximation Algorithm for the Multiple TSP with a Fixed Number of Depots (Q2802244) (← links)
- Reassembling Trees for the Traveling Salesman (Q2806177) (← links)
- On the Approximation Ratio of the Path Matching Christofides Algorithm (Q2891381) (← links)
- Approximation algorithms and heuristics for a 2-depot, heterogeneous Hamiltonian path problem (Q2903995) (← links)
- Improved Approximations for Hard Optimization Problems via Problem Instance Classification (Q3003467) (← links)
- Balancing the stations of a self service “bike hire” system (Q3016180) (← links)
- Structural Properties of Hard Metric TSP Inputs (Q3075532) (← links)
- Better s-t-Tours by Gao Trees (Q3186497) (← links)
- (Q3191144) (← links)
- Differential approximation of NP-hard problems with equal size feasible solutions (Q4457890) (← links)
- Approximation Algorithms for Not Necessarily Disjoint Clustered TSP (Q4554892) (← links)
- On the Metric $s$--$t$ Path Traveling Salesman Problem (Q4641715) (← links)
