DeepAI AI Chat
Log In Sign Up

Fixed-Parameter Sensitivity Oracles

12/06/2021
by   Davide Bilò, et al.
Hasso Plattner Institute
Indian Institute of Technology Delhi
Uniss
The Academic College of Tel Aviv Yaffo
0

We combine ideas from distance sensitivity oracles (DSOs) and fixed-parameter tractability (FPT) to design sensitivity oracles for FPT graph problems. An oracle with sensitivity f for an FPT problem Π on a graph G with parameter k preprocesses G in time O(g(f,k) ·(n)). When queried with a set F of at most f edges of G, the oracle reports the answer to the Π-with the same parameter k-on the graph G-F, i.e., G deprived of F. The oracle should answer queries in a time that is significantly faster than merely running the best-known FPT algorithm on G-F from scratch. We mainly design sensitivity oracles for the k-Path and the k-Vertex Cover problem. Following our line of research connecting fault-tolerant FPT and shortest paths problems, we also introduce parameterization to the computation of distance preservers. We study the problem, given a directed unweighted graph with a fixed source s and parameters f and k, to construct a polynomial-sized oracle that efficiently reports, for any target vertex v and set F of at most f edges, whether the distance from s to v increases at most by an additive term of k in G-F.

READ FULL TEXT

page 3

page 5

page 6

page 7

page 9

page 11

page 13

page 15

06/30/2022

Near Optimal Algorithm for Fault Tolerant Distance Oracle and Single Source Replacement Path problem

In a graph G with a source s, we design a distance oracle that can answe...
05/17/2019

Deterministic Combinatorial Replacement Paths and Distance Sensitivity Oracles

In this work we derandomize two central results in graph algorithms, rep...
02/17/2021

Constructing a Distance Sensitivity Oracle in O(n^2.5794M) Time

We continue the study of distance sensitivity oracles (DSOs). Given a di...
04/27/2023

Compact Distance Oracles with Large Sensitivity and Low Stretch

An f-edge fault-tolerant distance sensitive oracle (f-DSO) with stretch ...
06/16/2018

Fast Distance Sensitivity Oracle for Multiple Failures

When a network is prone to failures, it is very expensive to compute the...
04/22/2022

Parameterized Sensitivity Oracles and Dynamic Algorithms using Exterior Algebras

We design the first efficient sensitivity oracles and dynamic algorithms...
06/05/2023

Hyper-distance Oracles in Hypergraphs

We study point-to-point distance estimation in hypergraphs, where the qu...