Pages that link to "Item:Q484552"

The following pages link to 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):

Displaying 50 items.

• A 7/6-approximation algorithm for the minimum 2-edge connected subgraph problem in bipartite cubic graphs (Q284336) (← links)
• Traveling salesman problems in temporal graphs (Q284573) (← links)
• A \(\frac{5}{4}\)-approximation for subcubic 2EC using circulations and obliged edges (Q298954) (← links)
• A \(\frac{9}{7}\)-approximation algorithm for graphic TSP in cubic bipartite graphs (Q298977) (← links)
• The Steiner traveling salesman problem with online edge blockages (Q319009) (← links)
• New inapproximability bounds for TSP (Q494069) (← links)
• LP-relaxations for tree augmentation (Q1706120) (← links)
• Tour recommendation for groups (Q1741326) (← links)
• Simple cubic graphs with no short traveling salesman tour (Q1752607) (← links)
• On the integrality ratio of the subtour LP for Euclidean TSP (Q1785291) (← links)
• On the minimum-cost \(\lambda\)-edge-connected \(k\)-subgraph problem (Q1789587) (← links)
• Better \(s-t\)-tours by Gao trees (Q1800996) (← links)
• Constant factor approximation for ATSP with two edge weights (Q1801010) (← links)
• Improved approximations for cubic bipartite and cubic TSP (Q1801011) (← links)
• Efficient constructions of convex combinations for 2-edge-connected subgraphs on fundamental classes (Q2067494) (← links)
• Approximation algorithms with constant ratio for general cluster routing problems (Q2084625) (← links)
• Approximating TSP walks in subcubic graphs (Q2101165) (← links)
• Flexible graph connectivity (Q2118137) (← links)
• A LP-based approximation algorithm for generalized traveling salesperson path problem (Q2150585) (← links)
• Weighted amplifiers and inapproximability results for travelling salesman problem (Q2156301) (← links)
• A simple LP-based approximation algorithm for the matching augmentation problem (Q2164677) (← links)
• The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm (Q2191772) (← links)
• Shorter tours and longer detours: uniform covers and a bit beyond (Q2220659) (← links)
• The salesman's improved tours for fundamental classes (Q2227538) (← links)
• \(\frac{13}{9}\)-approximation for graphic TSP (Q2254507) (← links)
• Parity polytopes and binarization (Q2283103) (← links)
• Approximating minimum-cost connected \(T\)-joins (Q2345942) (← links)
• An improved approximation algorithm for the traveling salesman problem with relaxed triangle inequality (Q2353642) (← links)
• An experimental evaluation of the best-of-many Christofides' algorithm for the traveling salesman problem (Q2408163) (← links)
• A 4/3-approximation for TSP on cubic 3-edge-connected graphs (Q2417175) (← links)
• Better approximability results for min-max tree/cycle/path cover problems (Q2420656) (← links)
• An LP-based \(\frac{3}{2}\)-approximation algorithm for the \(s-t\) path graph traveling salesman problem (Q2450741) (← links)
• The traveling salesman problem on cubic and subcubic graphs (Q2452378) (← links)
• A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem (Q2660410) (← 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)
• An LP-based approximation algorithm for the generalized traveling salesman path problem (Q2680860) (← links)
• A new approximation algorithm for the minimum 2-edge-connected spanning subgraph problem (Q2680988) (← links)
• Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours (Q2687058) (← links)
• Reassembling Trees for the Traveling Salesman (Q2806177) (← links)
• Towards Better Inapproximability Bounds for TSP: A Challenge of Global Dependencies (Q2947865) (← links)
• Better s-t-Tours by Gao Trees (Q3186497) (← links)
• Constant Factor Approximation for ATSP with Two Edge Weights (Q3186505) (← links)
• Improved Approximations for Cubic Bipartite and Cubic TSP (Q3186507) (← links)
• Approximation hardness of graphic TSP on cubic graphs (Q3194690) (← links)
• The Unbounded Integrality Gap of a Semidefinite Relaxation of the Traveling Salesman Problem (Q4577740) (← links)
• On the Metric $s$--$t$ Path Traveling Salesman Problem (Q4641715) (← links)
• A PTAS for Three-Edge-Connected Survivable Network Design in Planar Graphs (Q5002603) (← links)
• New Approximation Algorithms for (1,2)-TSP (Q5002675) (← links)
• Flexible Graph Connectivity (Q5041731) (← links)