
Accession Number : AD0742938
Title : The MCenter Problem.
Descriptive Note : Master's thesis,
Corporate Author : NAVAL POSTGRADUATE SCHOOL MONTEREY CALIF
Personal Author(s) : Lins,Roderick William
Report Date : DEC 1971
Pagination or Media Count : 35
Abstract : Solution algorithms are presented for the vertex mcenter and the absolute mcenter problem. Both algorithms use partitioning techniques. The algorithms use special properties of the maxmin node to test for optimality. The vertex mcenter algorithm establishes an order among all partitions of a graph according to the smallest vertex mradius each partition can have. It then directs one to calculate the vertex mradii only for those partitions which can provide a minimal vertex mradius. The absolute mcenter algorithm establishes an initial solution which may not be optimal. Other partitions are then tested against this solution to determine whether or not they provide a better solution. A point is reached at which no untested partition can improve the extant solution and the algorithm terminates. (Author)
Descriptors : (*GRAPHICS, THEOREMS), TOPOLOGY, MATRICES(MATHEMATICS), INEQUALITIES, ALGORITHMS, THESES
Subject Categories : Theoretical Mathematics
Distribution Statement : APPROVED FOR PUBLIC RELEASE