Dice Question Streamline Icon: https://streamlinehq.com

Close gaps for distributed distance sensitivity oracles on directed weighted graphs

Resolve the remaining open questions for distributed distance sensitivity oracles in the CONGEST model by narrowing or closing the gap between upper and lower bounds for directed weighted graphs.

Information Square Streamline Icon: https://streamlinehq.com

Background

The paper connects its techniques with recent work on distributed distance sensitivity oracles, noting unresolved issues for directed weighted graphs.

They specifically mention remaining open questions and highlight the persistent gap between upper and lower bounds in this setting.

References

Could the techniques introduced in our work help resolve the remaining open questions about the distance sensitivity oracle problem? Notably, a gap still exists between the upper and lower bounds for directed weighted graphs.

— Optimal Distributed Replacement Paths (2502.15378 - Chang et al., 21 Feb 2025) in Section: Conclusions and Open Problems (Distance sensitivity oracle)