Pages that link to "Item:Q5313020"
From MaRDI portal
The following pages link to Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313020):
Displaying 16 items.
- Time efficient \(k\)-shot broadcasting in known topology radio networks (Q352244) (← links)
- Information dissemination in unknown radio networks with large labels (Q391755) (← links)
- Improved lower bound for deterministic broadcasting in radio networks (Q551181) (← links)
- Broadcasting in geometric radio networks (Q924558) (← links)
- A note on the lower bound of centralized radio broadcasting for planar reachability graphs (Q1028487) (← links)
- The time complexity of deterministic broadcast radio networks (Q1894365) (← 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)
- Centralized asynchronous broadcast in radio networks (Q2383598) (← links)
- Time efficient centralized gossiping in radio networks (Q2383602) (← links)
- Deterministic M2M multicast in radio networks (Q2508975) (← links)
- Centralization of transmission in networks (Q2515584) (← links)
- Central limit theorem for time to broadcast in radio networks (Q2805321) (← links)
- Time-Efficient Broadcast in Radio Networks (Q3404475) (← links)
- Automata, Languages and Programming (Q5466503) (← links)