This site uses cookies to deliver our services and to ensure you get the best experience. By continuing to use this site, you consent to our use of cookies and acknowledge that you have read and understand our Privacy Policy, Cookie Policy, and Terms
This paper achieves O(n3 log log n/ log n) time for the 2center problems on a directed graph with non-negative edge costs under the conventional RAM model where only arithmetic ope...