Efficient algorithms with performance guarantees for some problems of finding several cliques in a complete undirected weighted graph