Two exact algorithms for the packet scheduling problem

DOI10.1007/978-3-031-49611-0_10MaRDI QIDQ6606173zbMATH OpenFDO

Authors Fei Li, Ningshi Yao

Publication date 16 September 2024

Full work available at URL https://doi.org/10.1007/978-3-031-49611-0_10

zbMATH Keywords

dynamic programmingexact algorithmspacket scheduling

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites work

• A packet routing protocol for arbitrary networks
• A simpler proof for \(O(\mathrm{congestion} + \mathrm{dilation})\) packet routing
• Combinatorial optimization. Theory and algorithms
• Fast algorithms for finding \(O\)(Congestion+Dilation) packet routing schedules
• Greedy Packet Scheduling on Shortest Paths
• scientific article; zbMATH DE number 718142 (Why is no real title available?)
• scientific article; zbMATH DE number 1559580 (Why is no real title available?)
• Packet routing and job-shop scheduling in \(O\) (congestion + dilation) steps
• Packet Routing: Complexity and Algorithms
• Probability and computing. Randomization and probabilistic techniques in algorithms and data analysis
• Universal packet routing with arbitrary bandwidths and transit times
• Waiting for trains: complexity results

This page was built for publication: Two exact algorithms for the packet scheduling problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606173)