Constructing competitive tours from local information (Q1331954): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q547301 / rank
Normal rank
 
Property / author
 
Property / author: Kirk R. Pruhs / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0304-3975(94)90155-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2065818036 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Insertion Methods for TSP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3796804 / 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: Q3138961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Reliable Communication Networks of Small Weight Online / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to learn an unknown environment. I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Algorithms for Layered Graph Traversal / 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: Q4010316 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Randomized <i>k</i>-Server and Motion-Planning Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3484376 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spacefilling curves and the planar travelling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3694703 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The relative neighbourhood graph of a finite planar set / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:31, 22 May 2024

scientific article
Language Label Description Also known as
English
Constructing competitive tours from local information
scientific article

    Statements

    Constructing competitive tours from local information (English)
    0 references
    0 references
    0 references
    21 June 2000
    0 references
    0 references
    0 references