Algorithmics of Wireless Networks: 21st International Symposium, ALGOWIN 2025, Warsaw, Poland, September...

— —

Othon Michail Giuseppe Prencipe

Algorithmics of Wireless Networks

21st International Symposium, ALGOWIN 2025, Warsaw, Poland, September 18–19, 2025, Proceedings...

Othon Michail, Giuseppe Prencipe

$126.95 $101.37

Paperback

Forthcoming
Pre-Order now

QTY:

English

Springer Nature Switzerland AG
28 December 2025

Computer hardware; Mathematical theory of computation; Artificial intelligence

Series: Lecture Notes in Computer Science

This book constitutes the refereed proceedings of the 21st International Symposium on Algorithmics of Wireless Networks, ALGOWIN 2025, held in Warsaw, Poland, in September 2025.

The 13 papers included in these proceedings were carefully reviewed and selected from 24 submissions. They focus on the design and analysis of algorithms, models of computation, graph and network algorithms, and experimental analysis.

Edited by: Othon Michail, Giuseppe Prencipe
Imprint: Springer Nature Switzerland AG
Country of Publication: Switzerland
Dimensions: Height: 235mm, Width: 155mm,
ISBN: 9783032091192
ISBN 10: 3032091195
Series: Lecture Notes in Computer Science
Pages: 197
Publication Date: 28 December 2025
Audience: College/higher education , Professional and scholarly , Further / Higher Education , Undergraduate
Format: Paperback
Publisher's Status: Forthcoming

Distributed Weak Independent Sets in Hypergraphs: Upper and Lower Bounds.- Approximating Temporal Modularity on Graphs of Small Underlying Treewidth.- Round-asynchronous Amnesiac Flooding.- Optimizing the Number of Drones for Aerial Power-Line Maintenance.- Almost Tight Oracles for Fastest-Path Queries on Temporal Trees.- Temporal Orienteering with Changing Fuel Costs.- Parameterised Algorithms for Temporally Satisfying Reconfiguration Problems.- Temporal Cycle Detection and Acyclic Temporalizations.- Graph Traversal via Connected Mobile Agents.- Time-optimal Asynchronous Minimal Vertex Covering by Myopic Robots on Graph.- Linear Search for Capturing an Oblivious Mobile target in the Sender/Receiver Model.- A Logarithmic Approximation Algorithm for the Activation Edge-multicover Problem.- Capturing an Invisible Robber using Separators.