Pages that link to "Item:Q4828562"
From MaRDI portal
The following pages link to Logarithmic inapproximability of the radio broadcast problem (Q4828562):
Displayed 7 items.
- Many-to-many communication in radio networks (Q1024217) (← links)
- Optimal gathering protocols on paths under interference constraints (Q1045041) (← links)
- Optimal deterministic broadcasting in known topology radio networks (Q1954200) (← links)
- Faster communication in known topology radio networks (Q1954206) (← links)
- Improved algorithm for broadcast scheduling of minimal latency in wireless ad hoc networks (Q2267270) (← links)
- Time-Efficient Broadcast in Radio Networks (Q3404475) (← links)
- GATHERING RADIO MESSAGES IN THE PATH (Q4928335) (← links)