Description

Book Synopsis

Collision Free Robot Scheduling.- On the Exponential Growth of Geometric Shapes.- Optimizing Robot Dispersion on Unoriented Grids with and without Fault Tolerance.- Channel allocation revisited through 1 extendability of graphs.- On the Min Max Star Partitioning Number.- Collision Detection for Modular Robots it is easy to cause collisions and hard to avoid them.- Bike Assisted Evacuation on a Line of Robots with Communication Faults.- On Permutation Selectors and Their Applications in Ad Hoc Radio Networks Protocols.- Reconfigurable routing in data center networks.- The threshold of existence of delta temporal cliques in random simple temporal graphs.- The Exact Spanning Ratio of the Parallelogram Delaunay Graph.- A 1.5 approximation algorithm for activating 2 disjoint st paths.- Modular population protocols.- Decreasing verification radius in local certification.

Algorithmics of Wireless Networks

    Product form

    £58.49

    Includes FREE delivery

    RRP £64.99 – you save £6.50 (10%)

    Order before 4pm tomorrow for delivery by Wed 17 Jun 2026.

    A Paperback by Quentin Bramas

    15 in stock


      View other formats and editions of Algorithmics of Wireless Networks by Quentin Bramas

      Publisher: Springer
      Publication Date: 27/12/2024
      ISBN13: 9783031745799, 978-3031745799
      ISBN10:
      Also in:
      Computing Mathematical theory of computation

      Description

      Book Synopsis

      Collision Free Robot Scheduling.- On the Exponential Growth of Geometric Shapes.- Optimizing Robot Dispersion on Unoriented Grids with and without Fault Tolerance.- Channel allocation revisited through 1 extendability of graphs.- On the Min Max Star Partitioning Number.- Collision Detection for Modular Robots it is easy to cause collisions and hard to avoid them.- Bike Assisted Evacuation on a Line of Robots with Communication Faults.- On Permutation Selectors and Their Applications in Ad Hoc Radio Networks Protocols.- Reconfigurable routing in data center networks.- The threshold of existence of delta temporal cliques in random simple temporal graphs.- The Exact Spanning Ratio of the Parallelogram Delaunay Graph.- A 1.5 approximation algorithm for activating 2 disjoint st paths.- Modular population protocols.- Decreasing verification radius in local certification.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account