An improved upper bound for the TSP in cubic 3-edge-connected graphs (Q2488197): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.orl.2004.09.005 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1993298089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250161 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Traveling Salesman Problem with Range Condition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4187840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Traveling Salesman Problem with Distances One and Two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analyzing the Held-Karp TSP bound: A monotonicity property with application / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic analysis, linear programming and branch and bound / rank
 
Normal rank

Latest revision as of 14:33, 10 June 2024

scientific article
Language Label Description Also known as
English
An improved upper bound for the TSP in cubic 3-edge-connected graphs
scientific article

    Statements

    An improved upper bound for the TSP in cubic 3-edge-connected graphs (English)
    0 references
    0 references
    0 references
    0 references
    25 August 2005
    0 references
    approximation algorithms
    0 references
    traveling salesman problem
    0 references
    graphs
    0 references
    regular graphs
    0 references

    Identifiers