AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
We have 2 of 17 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
A randomized near-linear time algorithm is presented that achieves a $3-approximation to the min-diameter in near-linear time, dramatically improving over the previously best known $n$-approximation.
This paper provides a tight reduction demonstrating that any exact distance sensitivity oracle can be used to efficiently solve decremental exact diameter and all-node eccentricities and introduces two new instructive techniques and demonstrates how to utilize them to construct several new algorithms.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.