Routing optimization for in-orbit federated learning is polynomial-time solvable under some settings like certain unicast or multicast flows and NP-hard under others, with rigorous proofs establishing the boundaries.
Routing of multipoint connections,
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Q-GUARD achieves over 85% qualified success rate on 4-hop paths in 100-node simulations by allocating per-hop fidelity targets via Werner-state equal-split and selecting paths with a segment-local expected-goodput metric.
citing papers explorer
-
Optimal Routing for Federated Learning over Dynamic Satellite Networks: Tractable or Not?
Routing optimization for in-orbit federated learning is polynomial-time solvable under some settings like certain unicast or multicast flows and NP-hard under others, with rigorous proofs establishing the boundaries.
-
Fidelity-Guaranteed Entanglement Routing with Distributed Purification Planning
Q-GUARD achieves over 85% qualified success rate on 4-hop paths in 100-node simulations by allocating per-hop fidelity targets via Werner-state equal-split and selecting paths with a segment-local expected-goodput metric.