TSP Tours in Cubic Graphs: Beyond 4/3 (Q5254089): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q65553899, #quickstatements; #temporary_batch_1706516978579
Created claim: DBLP publication ID (P1635): journals/siamdm/CorreaLS15, #quickstatements; #temporary_batch_1731508824982
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2138233424 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improving christofides' algorithm for the s-t path TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fractional Packing of<i>T</i>-Joins / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSP on Cubic and Subcubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3097395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of a new heuristic for the travelling salesman problem / 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: Worst-case comparison of valid inequalities for the 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: Q2904746 / 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: On the approximability of the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the integrality gap of the subtour LP for the 1,2-TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743492 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eight-Fifth Approximation for the Path 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: A new proof of 3-colorability of Eulerian triangulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic analysis, linear programming and branch and bound / rank
 
Normal rank
Property / DBLP publication ID
 
Property / DBLP publication ID: journals/siamdm/CorreaLS15 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:33, 13 November 2024

scientific article; zbMATH DE number 6443689
Language Label Description Also known as
English
TSP Tours in Cubic Graphs: Beyond 4/3
scientific article; zbMATH DE number 6443689

    Statements

    TSP Tours in Cubic Graphs: Beyond 4/3 (English)
    0 references
    0 references
    0 references
    0 references
    8 June 2015
    0 references
    traveling salesman problem
    0 references
    cubic graphs
    0 references
    integrality gap
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references