Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/106740
Title: A subquadratic-time algorithm for decremental single-source shortest paths
Authors: Nanongkai, Danupon
Henzinger, Monika
Krinninger, Sebastian
Keywords: DRNTU::Science::Mathematics::Discrete mathematics::Algorithms
Issue Date: 2014
Source: Henzinger, M., Krinninger, S., & Nanongkai, D. (2014). A subquadratic-time algorithm for decremental single-source shortest paths. Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, 1053-1072.
Conference: Annual ACM-SIAM Symposium on Discrete Algorithms, SODA (25th : 2014)
Abstract: We study dynamic (1 + ∊)-approximation algorithms for the single-source shortest paths problem in an unweighted undirected n-node m-edge graph under edge deletions. The fastest algorithm for this problem is an algorithm with O(n2+o(1)) total update time and constant query time by Bernstein and Roditty (SODA 2011). In this paper, we improve the total update time to O(n1.8+o(1) + m1+o(1)) while keeping the query time constant. This running time is essentially tight when m = Ω(n1.8) since we need Ω(m) time even in the static setting. For smaller values of m, the running time of our algorithm is subquadratic, and is the first that breaks through the quadratic time barrier. In obtaining this result, we develop a fast algorithm for what we call center cover data structure. We also make non-trivial extensions to our previous techniques called lazy-update and monotone Even-Shiloach trees (ICALP 2013 and FOCS 2013). As by-products of our new techniques, we obtain two new results for the decremental all-pairs shortest-paths problem. Our first result is the first approximation algorithm whose total update time is faster than Õ(mn) for all values of m. Our second result is a new trade-off between the total update time and the additive approximation guarantee.
URI: https://hdl.handle.net/10356/106740
http://hdl.handle.net/10220/25074
URL: http://epubs.siam.org/doi/abs/10.1137/1.9781611973402.79
Schools: School of Physical and Mathematical Sciences 
Rights: © 2014 Society for Industrial and Applied Mathematics. This paper was published in Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms and is made available as an electronic reprint (preprint) with permission of Society for Industrial and Applied Mathematics. The paper can be found at the following URL: [http://epubs.siam.org/doi/abs/10.1137/1.9781611973402.79]. One print or electronic copy may be made for personal use only. Systematic or multiple reproduction, distribution to multiple locations via electronic or other means, duplication of any material in this paper for a fee or for commercial purposes, or modification of the content of the paper is prohibited and is subject to penalties under law.
Fulltext Permission: open
Fulltext Availability: With Fulltext
Appears in Collections:SPMS Conference Papers

Files in This Item:
File Description SizeFormat 
A subquadratic-time algorithm for decremental single-source shortest paths.pdf523.18 kBAdobe PDFThumbnail
View/Open

Page view(s) 50

548
Updated on Mar 26, 2024

Download(s) 20

212
Updated on Mar 26, 2024

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.