Utility-Based Path Selection and Configuration in Quantum Networks via Layered Shortest Paths
It is proved that for certain utility functions (including the secret key rate of BB84), the method is a fully polynomial time approximation scheme, returning a near-optimal path within a specified tolerance.