CitedEvidence
User Settings
Other10.1090/psapm/010/0122573

On some communication network problems

Robert E. Kalaba-1960-01-01-Proceedings of symposia in applied mathematics
30

TL;DRAbstract

Abstract : Several classes of combinat2rial problems in the field of communication networks are discussed including the leasing of minimal cost spanning networks, the finding of optimal paths through networks, and the optimal routing of messages in networks. The methods employed involve curious admixtures of the functional equation approach of dynamic programming, linear programming, and various ad hoc procedures.

Chat with Paper

AI Agents for this Paper

Abstract : Several classes of combinat2rial problems in the field of communication networks are discussed including the leasing of minimal cost spanning networks, the finding of optimal paths through networks, and the optimal routing of messages in networks. The methods employed involve curious admixtures of the functional equation approach of dynamic programming, linear programming, and various ad hoc procedures.

Keywords

Computer scienceRouting (electronic design automation)Wireless ad hoc networkField (mathematics)Linear programmingDistributed computingDynamic programmingTelecommunications network

Chat

Click to start Chat