The Power of Recourse for Online MST and TSP (Q5890825): Difference between revisions

From MaRDI portal
Changed an 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: W2469267808 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line Steiner trees in the Euclidean plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the on-line travelling salesman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Not all insertion methods yield constant approximate tours in the Euclidean plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / 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: Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The power of deferral / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Steiner Tree with Deletions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing competitive tours from local information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3677509 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online graph exploration: New results on old and new algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Power of Recourse for Online MST and TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of combinatorial optimization problems in multicast routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank

Latest revision as of 06:03, 12 July 2024

scientific article; zbMATH DE number 6600655
Language Label Description Also known as
English
The Power of Recourse for Online MST and TSP
scientific article; zbMATH DE number 6600655

    Statements

    The Power of Recourse for Online MST and TSP (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 July 2016
    0 references
    online algorithms
    0 references
    minimum spanning tree
    0 references
    traveling salesman
    0 references
    recourse
    0 references

    Identifiers

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