Aggregation tree construction using hierarchical structures
DOI10.1007/978-3-031-35305-5_7zbMATH Open1519.90049OpenAlexW4381956642MaRDI QIDQ6134051FDOQ6134051
Authors: A. I. Erzin, Roman Plotnikov, Ilya Ladygin
Publication date: 21 August 2023
Published in: Mathematical Optimization Theory and Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-35305-5_7
Recommendations
Approximation methods and heuristics in mathematical programming (90C59) Deterministic network models in operations research (90B10) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Communication networks in operations research (90B18) Wireless sensor networks as related to computer science (68M18)
Cites Work
- Optimum branchings
- Variable neighborhood search: Principles and applications
- The capacity of wireless networks
- Title not available (Why is that?)
- Variable neighborhood decomposition search
- Introduction to Genetic Algorithms
- Improved algorithm for minimum data aggregation time problem in wireless sensor networks
- Scheduling algorithms for tree-based data collection in wireless sensor networks
- Genetic local search for conflict-free minimum-latency aggregation scheduling in wireless sensor networks
- Variable neighborhood search-based heuristics for MIN-power symmetric connectivity problem in wireless networks
- Conflict-Free Data Aggregation on a Square Grid When Transmission Distance is Not Less Than 3
Cited In (1)
This page was built for publication: Aggregation tree construction using hierarchical structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134051)