Competitive weighted throughput analysis of greedy protocols on dags
From MaRDI portal
Online algorithms; streaming algorithms (68W27) Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Network design and communication in computer systems (68M10) Network protocols (68M12)
Recommendations
This page was built for publication: Competitive weighted throughput analysis of greedy protocols on dags
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6486949)