Minimax problem of suppressing a communication network
From MaRDI portal
(Redirected from Publication:822223)
Recommendations
- Maximin problem of communication network synthesis
- scientific article; zbMATH DE number 558538
- scientific article; zbMATH DE number 2144765
- Solutions to a class of minimax decision problems arising in communication systems
- A minimax assignment problem in treelike communication networks
- On the minimization of communication in networked systems with a central station
- Minimum cost flow‐dependent communication networks
- Game-theoretic approaches to optimization problems in communication networks
- Minimax control over unreliable communication channels
- On the structure of minimum communication overlap networks
Cites work
- Algorithms for maximization of supermodular functions and their application in the optimization of grouping provinces in a region
- Constructing maximal dynamic flows from static flows
- scientific article; zbMATH DE number 3174052 (Why is no real title available?)
- scientific article; zbMATH DE number 3926625 (Why is no real title available?)
- Maximal Flow Through a Network
- On network flow functions
Cited in
(2)
This page was built for publication: Minimax problem of suppressing a communication network
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q822223)