Pages that link to "Item:Q1390338"
From MaRDI portal
The following pages link to A minimax assignment problem in treelike communication networks (Q1390338):
Displaying 14 items.
- Selected topics on assignment problems (Q697571) (← links)
- Minimax problem of suppressing a communication network (Q822223) (← links)
- Random assignment problems (Q953417) (← links)
- Communication tree problems (Q995575) (← links)
- A polynomial-time algorithm for message routing in hierarchical communication networks (Q1129965) (← links)
- On the finite transmission zero assignment problem (Q1261100) (← links)
- Minimizing broadcast costs under edge reductions in tree networks (Q1283789) (← links)
- Call routing and the ratcatcher (Q1330799) (← links)
- The optimal arrangement of communication centres linked by a trunk (Q1338157) (← links)
- On a class of branching problems in broadcasting and distribution (Q1761092) (← links)
- A dynamic programming algorithm for the generalized minimum filter placement problem on tree structures (Q2901069) (← links)
- On the np-completeness of certain network testing problems (Q3315441) (← links)
- (Q4289892) (← links)
- Costing communication standards in information systems using a minimum cut approach (Q4678243) (← links)