Traveling salesmen in the presence of competition (Q1884998): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(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: W2090371674 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: cs/0212001 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The freeze-tag problem: How to wake up a swarm of robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3944542 / rank
 
Normal rank
Property / cites work
 
Property / cites work: PSPACE-Hardness of some combinatorial games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of problems in games, graphs and algebraic equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of pursuit on a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some two-person perfect-information games / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:52, 7 June 2024

scientific article
Language Label Description Also known as
English
Traveling salesmen in the presence of competition
scientific article

    Statements

    Traveling salesmen in the presence of competition (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    27 October 2004
    0 references
    Combinatorial games
    0 references
    Complexity
    0 references
    PSPACE-completeness
    0 references
    Strategy stealing
    0 references
    Traveling salesman problem (TSP)
    0 references
    Competing salesmen problem (CSP)
    0 references

    Identifiers

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