Near-optimal schedules for simultaneous multicasts
From MaRDI portal
Cites work
- A constant-factor approximation algorithm for packet routing and balancing local vs. global criteria
- A data structure for dynamic trees
- A packet routing protocol for arbitrary networks
- A simpler proof for \(O(\mathrm{congestion} + \mathrm{dilation})\) packet routing
- A trade-off between information and communication in broadcast protocols
- Algorithms – ESA 2004
- Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
- Chernoff–Hoeffding Bounds for Applications with Limited Independence
- Distributed algorithms for planar networks. I: Planar embedding
- Distributed algorithms for planar networks. II: Low-congestion shortcuts, MST, and Min-Cut
- Distributed Broadcast Revisited: Towards Universal Optimality
- Distributed Computing: A Locality-Sensitive Approach
- Efficient distributed source detection with limited bandwidth
- Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
- scientific article; zbMATH DE number 1256754 (Why is no real title available?)
- scientific article; zbMATH DE number 2079323 (Why is no real title available?)
- scientific article; zbMATH DE number 1522943 (Why is no real title available?)
- scientific article; zbMATH DE number 1559580 (Why is no real title available?)
- scientific article; zbMATH DE number 7561283 (Why is no real title available?)
- Improved Distributed Approximations for Minimum-Weight Two-Edge-Connected Spanning Subgraph
- Low-congestion shortcut and graph parameters
- Low-Congestion Shortcuts in Constant Diameter Graphs
- Low-congestion shortcuts without embedding
- Message Multicasting in Heterogeneous Networks
- Minor excluded network families admit fast distributed algorithms
- Near-optimal low-congestion shortcuts on bounded parameter graphs
- Near-optimal scheduling of distributed algorithms
- Optimal distributed all pairs shortest paths and applications
- Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
- Packet Routing: Complexity and Algorithms
- Plane gossip: approximating rumor spread in planar graphs
- Randomized metarounding
- Real-Time Message Routing and Scheduling
- Round- and message-optimal distributed graph algorithms
- Rumors across radio, wireless, telephone
- Shortest-Path Routing in Arbitrary Networks
- The probabilistic method
- Universal packet routing with arbitrary bandwidths and transit times
- Universally-optimal distributed algorithms for known topologies
This page was built for publication: Near-optimal schedules for simultaneous multicasts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7241176)
