Spanning closed walks and TSP in 3-connected planar graphs (Q462924): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An upper bound on the length of a Hamiltonian walk of a maximal planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Trees in Polyhedral Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Contraction decomposition in h-minor-free graphs and algorithmic applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-walks in circuit 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: The Traveling-Salesman Problem and Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4014627 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgraphs of graphs on surfaces with high representativity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Graphic TSP by Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple paths on polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: 3-trees with few vertices of degree 3 in circuit graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the Hamiltonian walk problem on maximal planar graphs / 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: Graph minors. VII: Disjoint paths on a surface / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-connected projective planar graphs are Hamiltonian / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on paths in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4869540 / rank
 
Normal rank

Revision as of 04:33, 9 July 2024

scientific article
Language Label Description Also known as
English
Spanning closed walks and TSP in 3-connected planar graphs
scientific article

    Statements

    Spanning closed walks and TSP in 3-connected planar graphs (English)
    0 references
    0 references
    0 references
    22 October 2014
    0 references
    closed walk
    0 references
    3-connected planar graphs
    0 references
    TSP
    0 references
    Held-Karp relaxation
    0 references
    integrality gap
    0 references
    4/3-conjecture
    0 references

    Identifiers