Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

DOI10.1007/11538462MaRDI QIDQ5479354zbMATH OpenOpenAlexFDO

Authors Stanislav Angelov, Sanjeev Khanna, Keshav Kunal

Publication date 7 July 2006

Full work available at URL https://doi.org/10.1007/11538462

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Stochastic network models in operations research (90B15) Network design and communication in computer systems (68M10)

Recommendations

• The network as a storage device: dynamic routing with bounded buffers
• scientific article; zbMATH DE number 2079411
• Online packet-routing in grids with bounded buffers
• Concurrent threads and optimal parallel minimum spanning trees algorithm
• From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols

Cited in

(7)

• scientific article; zbMATH DE number 2079411 (Why is no real title available?)
• scientific article; zbMATH DE number 3934807 (Why is no real title available?)
• The network as a storage device: dynamic routing with bounded buffers
• From Static to Dynamic Routing: Efficient Transformations of Store-and-Forward Protocols
• An \(O(\log n)\)-competitive online centralized randomized packet-routing algorithm for lines
• Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks
• Online packet-routing in grids with bounded buffers

This page was built for publication: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques

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