Search and delivery man problems: when are depth-first paths optimal? (Q2184055): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Hide-and-Seek Games on a Network, Using Combinatorial Search Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search Games on Trees with Asymmetric Travel Times / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to Gal's theory of search games on weakly Eulerian networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network search games with immobile hider, without a designated searcher starting point / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching symmetric networks with Utilitarian-Postman paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: The theory of search games and rendezvous. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mining Coal or Finding Terrorists: The Expanding Search Paradigm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching a Variable Speed Network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Schemes for Minimum Latency Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalizations in the linear search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search games on networks with travelling and search costs and with arbitrary searcher starting points / rank
 
Normal rank
Property / cites work
 
Property / cites work: A search problem on a bipartite network / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the linear search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: More on the linear search problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Revenge of the Linear Search Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network search games, with arbitrary searcher starting point / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polyhedral Approach to the Asymmetric Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Submodular Search and Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Search Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search Games with Mobile and Immobile Hider / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search games and other applications of game theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation ratio for the minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Star search -- a different show / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multiple searchers searching for a randomly distributed immobile target on a unit network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search Games with Multiple Hidden Objects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a hider by an unknown deadline / rank
 
Normal rank
Property / cites work
 
Property / cites work: The delivery man problem on a tree network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737530 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-factor approximation algorithm for the asymmetric traveling salesman problem / rank
 
Normal rank

Latest revision as of 19:51, 22 July 2024

scientific article
Language Label Description Also known as
English
Search and delivery man problems: when are depth-first paths optimal?
scientific article

    Statements

    Search and delivery man problems: when are depth-first paths optimal? (English)
    0 references
    27 May 2020
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    networks
    0 references
    depth-first search
    0 references
    delivery man problem
    0 references
    trees
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references