Complexity results for compressing optimal paths

Adi Botea, Ben Strasser, Daniel Harabor

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

3 Citations (Scopus)


In this work we give a first tractability analysis of Compressed Path Databases, space efficient oracles used to very quickly identify the first arc on a shortest path. We study the complexity of computing an optimal compressed path database for general directed and undirected graphs. We find that in both cases the problem is NP-complete. We also show that, for graphs which can be decomposed along articulation points, the problem can be decomposed into independent parts, with a corresponding reduction in its level of difficulty. In particular, this leads to simple and tractable algorithms which yield optimal compression results for trees.

Original languageEnglish
Title of host publicationProceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence and the Twenty-Seventh Innovative Applications of Artificial Intelligence Conference
Subtitle of host publication25-30 January 2015 Austin, Texas USA
EditorsBlai Bonet, Sven Koenig
Place of PublicationPalo Alto California USA
PublisherAssociation for the Advancement of Artificial Intelligence (AAAI)
Number of pages7
ISBN (Print)9781577357001
Publication statusPublished - 2015
Externally publishedYes
EventAAAI Conference on Artificial Intelligence 2015 - Hyatt Regency, Austin, United States of America
Duration: 25 Jan 201530 Jan 2015
Conference number: 29th


ConferenceAAAI Conference on Artificial Intelligence 2015
Abbreviated titleAAAI 2015
Country/TerritoryUnited States of America
Otherco-located with the 27th Innovative Applications of Artificial Intelligence Conference
Internet address

Cite this