An algorithm is derived to optimize the number of branches in the equivalent network representing dielectric dispersion with many relaxation times. The algorithm is characterized by deriving general normalized relations. Satisfactory results are obtained for a network with more than 50% reduction in the number of branches for dispersion data of perfluoropolyether dielectric. The method is directly applicable to dispersion relations featuring weakly overlapping arcs in the complex plane of the dielectric constant. The procedure is also extendible for relations with strong arcs overlapping, such as in polymers and composite materials.