Given a undirected weighted graph. I would like to find a finite set of paths (consecutive vertices and edges)
each shorter than L
any two vertices can be reached through at most N(in my case N=4) such paths.(paths can be linked halfway, i.e. not necessarily through the begin/end vert).
and the total length of my path set is as small as possible.
In general, I'd like to know if there are relevent theories or algorithms that I can apply to my specific data set.
Thanks in advance for any thought or direction!