Optimal Gathering Over Weber Meeting Nodes in Infinite Grid (Q6169957): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Normalize DOI.
 
(2 intermediate revisions by 2 users not shown)
Property / DOI
 
Property / DOI: 10.1142/s0129054122500174 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W4285800715 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering over meeting nodes in infinite grid / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering over Meeting Nodes in Infinite Grid* / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(k\)-circle formation by disoriented asynchronous robots / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering of robots on meeting-points: feasibility and optimal resolution algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedded pattern formation by asynchronous robots without chirality / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering robots in graphs: the central role of synchronicity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4449250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Euclidean Constructibility in Graph-Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering of robots on anonymous grids and trees without multiplicity detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering on rings under the look-compute-move model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering six oblivious robots on anonymous symmetric rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing on rings by oblivious robots: a unified approach for different tasks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering of oblivious robots on infinite grids with minimum traveled distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing by Mobile Robotic Sensors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering of asynchronous robots with limited visibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mobile Robots Gathering Algorithm with Local Weak Multiplicity in Rings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Gathering asynchronous oblivious mobile robots in a ring / rank
 
Normal rank
Property / cites work
 
Property / cites work: An extension of the Fermat-Torricelli problem / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1142/S0129054122500174 / rank
 
Normal rank

Latest revision as of 09:56, 31 December 2024

scientific article; zbMATH DE number 7727027
Language Label Description Also known as
English
Optimal Gathering Over Weber Meeting Nodes in Infinite Grid
scientific article; zbMATH DE number 7727027

    Statements

    Optimal Gathering Over Weber Meeting Nodes in Infinite Grid (English)
    0 references
    0 references
    0 references
    0 references
    15 August 2023
    0 references
    gathering
    0 references
    meeting nodes
    0 references
    grid
    0 references
    asynchronous
    0 references
    look-compute-move cycle
    0 references
    Weber meeting nodes
    0 references
    0 references

    Identifiers