Minimum-cost line broadcast in paths

DOI10.1016/S0166-218X(97)00097-8zbMATH Open0883.90059MaRDI QIDQ1363771FDOQ1363771

Satoshi Fujita, Arthur M. Farley

Publication date: 11 August 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: http://www.elsevier.com/locate/dam

zbMATH Keywords

line communication protocoloptimal, line broadcast scheme

Mathematics Subject Classification ID

Paths and cycles (05C38) Communication networks in operations research (90B18) Channel models (including quantum) in information and communication theory (94A40)

Cites Work

• Optimal Linear Broadcast
• An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes
• Line broadcasting in cycles
• Optimal fully adaptive minimal wormhole routing for meshes
• Gossiping in vertex-disjoint paths mode in \(d\)-dimensional grids and planar graphs
• Title not available (Why is that?)
• Minimum-cost line broadcast in paths
• Minimum-time line broadcast networks
• Optimal algorithms for dissemination of information in generalized communication modes
• Linear broadcast routing

Cited In (5)

• Minimum-cost line broadcast in paths
• Short-length routes in low-cost networks via Poisson line patterns
• Efficient line broadcasting in a \(d\)-dimensional grid
• Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees
• Minimum cost path problems with relays

   Recommendations

• Low‐cost minimum‐time line‐broadcasting schemes in complete binary trees 👍 👎
• Minimal-Time k-Line Broadcasting 👍 👎
• Line broadcasting in cycles 👍 👎
• Broadcast networks with near optimal cost 👍 👎

This page was built for publication: Minimum-cost line broadcast in paths

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