| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNINA9910767543603321 |
|
|
Autore |
Georgiou Konstantinos |
|
|
Titolo |
Algorithmics of Wireless Networks : 19th International Symposium, ALGOWIN 2023, Amsterdam, The Netherlands, September 7–8, 2023, Revised Selected Papers / / edited by Konstantinos Georgiou, Evangelos Kranakis |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Cham : , : Springer Nature Switzerland : , : Imprint : Springer, , 2023 |
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 2023.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (160 pages) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 1611-3349 ; ; 14061 |
|
|
|
|
|
|
Altri autori (Persone) |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Algorithms |
Artificial intelligence |
Computer engineering |
Computer networks |
Design and Analysis of Algorithms |
Artificial Intelligence |
Computer Engineering and Networks |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Nota di contenuto |
|
Segment Visibility for k-transmitters -- Conflict Resolution in Arbitrary Hypergraphs -- Dispatching the Minimum Number of UAVs in Neighborhood IoT Networks -- Mutual Visibility with ASYNC Luminous Robots having Inaccurate Movements -- Minimum Degree and Connectivity in 1-Dimensional Line of Sight Networks -- WUBBLE: Energy Efficient BLE Neighborhood Discovery Leveraging Wake-up Radio -- Byzantine Fault-Tolerant Protocols for $(n, f)$-evacuation from a Circle -- Temporal Reachability Dominating Sets: contagion in temporal graphs -- Fair Scheduling Under Packet Management: Competitive Analysis of Age of Information -- Run for Cover: Dominating Set via Mobile Agents. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
This book constitutes the refereed proceedings of the 19th International Symposium on Algorithmics of Wireless Networks, ALGOWIN 2023, held in Amsterdam, The Netherlands, during September 7–8, 2023. The 10 full papers included in this book were |
|
|
|
|
|
|
|
|
|
|
carefully reviewed and selected from 22 submissions. They were organized in topical sections as follows: design and analysis of algorithms, models of computation and experimental analysis. |
|
|
|
|
|
| |