Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
From MaRDI portal
Publication:5313014
DOI10.1007/b99805zbMath1105.68302OpenAlexW4301133941MaRDI QIDQ5313014
Publication date: 25 August 2005
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b99805
Analysis of algorithms and problem complexity (68Q25) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)
Related Items
Upper and lower bounds for deterministic broadcast in powerline communication networks, Feasibility and complexity of broadcasting with random transmission failures, Optimal deterministic broadcasting in known topology radio networks, Faster communication in known topology radio networks, Near-optimal radio use for wireless network synchronization, Time-Efficient Broadcast in Radio Networks
