Online graph exploration: New results on old and new algorithms (Q1929219): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
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/j.tcs.2012.06.034 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W105334049 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q57399761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring Unknown Environments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weighted nearest neighbor algorithms for the graph exploration problem on cycles / 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: Piecemeal graph exploration by a mobile robot. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: An adversarial queueing model for online server routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal graph exploration without good maps / 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: Arc Routing Problems, Part I: The Chinese Postman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Theory and Probability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5725269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic cage survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4426350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective tree exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impact of memory size on graph exploration capability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Search games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Memory Efficient Anonymous Graph Exploration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online algorithms for searching and exploration in the plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: The traveling salesman problem and its variations / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the nearest neighbor rule for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Vehicle Routing Problems: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing competitive tours from local information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3007438 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a simple depth-first search strategy for exploring unknown graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2726740 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exploring Unknown Undirected Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths without a map / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank

Latest revision as of 02:20, 6 July 2024

scientific article
Language Label Description Also known as
English
Online graph exploration: New results on old and new algorithms
scientific article

    Statements

    Online graph exploration: New results on old and new algorithms (English)
    0 references
    0 references
    0 references
    0 references
    7 January 2013
    0 references
    0 references
    graph exploration
    0 references
    online algorithms
    0 references
    competitive analysis
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references