Minimise ratio of a k-spanning tree

Neo4j Graph Platform Graph Algorithms/Graph Data Science
1

I have a graph where relationships have 2 weights (lets call them a and b), and I want to maximize the ratio of all of the weights in the k-sized tree.

My problem is if I make the weights a/b, this isn't going to minimise the tree in the way I want... I want to minimize sum(a)/sum(b) and not sum(a/b). Is there any weight that I could use that would atleast approximate sum(a)/sum(b) or is the k-spanning-tree algo just the wrong approach for this?

Thanks in advance :)

2

Thanks for this tought provoking question. Your use case is clear but is not one I have encountered before.. Work may in progress in Academia on the subject, but I haven't seen this yet personally.

Please do come back if you find a thread in this area~