Approximating TSP walks in subcubic graphs (Q2101165): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4226436028 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the Exact Integrality Gap for Small Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem on cubic and subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP Tours in Cubic Graphs: Beyond 4/3 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphic TSP in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved upper bound for the TSP in cubic 3-edge-connected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Rounding Approach to the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case comparison of valid inequalities for the TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A (slightly) improved approximation algorithm for metric TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New inapproximability bounds for TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of graphic TSP on cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Inapproximability for TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Graphic TSP by Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\frac{13}{9}\)-approximation for graphic TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: 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 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3931037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A historical note on the 3/2-approximation algorithm for the metric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximations for Cubic Bipartite and Cubic TSP / rank
 
Normal rank

Latest revision as of 23:37, 30 July 2024

scientific article
Language Label Description Also known as
English
Approximating TSP walks in subcubic graphs
scientific article

    Statements

    Approximating TSP walks in subcubic graphs (English)
    0 references
    0 references
    0 references
    0 references
    28 November 2022
    0 references
    0 references
    graphic TSP
    0 references
    combinatorial optimization
    0 references
    approximation algorithms
    0 references
    0 references