scientific article; zbMATH DE number 6469200
From MaRDI portal
Publication:5501318
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25) Online algorithms; streaming algorithms (68W27) Communication networks in operations research (90B18) Theory of organizations, manpower planning in operations research (90B70)
Recommendations
- Competitive analysis of organization networks or multicast acknowledgment: how much to wait?
- Competitive routing in multicast communications
- A competitive analysis for retransmission timeout
- scientific article; zbMATH DE number 4008074
- Performance evaluation of multicast communication in packet-switched networks
- scientific article; zbMATH DE number 46747
- Competitive Analysis of Scheduling Algorithms for Aggregated Links
- Competitive analysis of scheduling algorithms for aggregated links
Cited in
(4)- Data aggregation in sensor networks: Balancing communication and delay costs
- Competitive analysis of organization networks or multicast acknowledgment: how much to wait?
- Latency Constrained Aggregation in Chain Networks Admits a PTAS
- Brief announcement: Delay or deliver dilemma in organization networks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501318)
