Online graph exploration algorithms for cycles and trees by multiple searchers (Q2251142): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Exploring Unknown Environments / 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: Algorithms for the on-line quota traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((p-1)/(p+1)\)-approximate algorithms for \(p\)-traveling salesmen problems on a tree with minmax objective / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online TSP Against Fair Adversaries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring an unknown graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Graph Exploration with Advice / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal constrained graph exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smart Robot Teams Exploring Sparse Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Why Robots Need Maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Competitive Online Approximation of the Optimal Search Ratio / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective tree exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Polygon Exploration 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: Online Graph Exploration: New Results on Old and New Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the minmax rooted-tree cover in a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring Unknown Undirected Graphs / rank
 
Normal rank

Latest revision as of 17:32, 8 July 2024

scientific article
Language Label Description Also known as
English
Online graph exploration algorithms for cycles and trees by multiple searchers
scientific article

    Statements

    Online graph exploration algorithms for cycles and trees by multiple searchers (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    11 July 2014
    0 references
    online algorithms
    0 references
    graph exploration
    0 references
    competitive ratio
    0 references

    Identifiers