On the hardness of allocating frequencies for hybrid networks
From MaRDI portal
Publication:6550553
DOI10.1007/3-540-62559-3_25zbMATH Open1539.68231MaRDI QIDQ6550553
Could not fetch data.
Publication date: 5 June 2024
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
This page was built for publication: On the hardness of allocating frequencies for hybrid networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6550553)
