On the Feasibility of Maintenance Algorithms in Dynamic Graphs release_dgnb25gcgzetbdtyadlajgcrlu

by Arnaud Casteigts, Bernard Mans, Luke Mathieson

Released as a article .

2012  

Abstract

Near ubiquitous mobile computing has led to intense interest in dynamic graph theory. This provides a new and challenging setting for algorithmics and complexity theory. For any graph-based problem, the rapid evolution of a (possibly disconnected) graph over time naturally leads to the important complexity question: is it better to calculate a new solution from scratch or to adapt the known solution on the prior graph to quickly provide a solution of guaranteed quality for the changed graph? In this paper, we demonstrate that the former is the best approach in some cases, but that there are cases where the latter is feasible. We prove that, under certain conditions, hard problems cannot even be approximated in any reasonable complexity bound --- i.e., even with a large amount of time, having a solution to a very similar graph does not help in computing a solution to the current graph. To achieve this, we formalize the idea as a maintenance algorithm. Using r-Regular Subgraph as the primary example we show that W[1]-hardness for the parameterized approximation problem implies the non-existence of a maintenance algorithm for the given approximation ratio. Conversely we show that Vertex Cover, which is fixed-parameter tractable, has a 2-approximate maintenance algorithm. The implications of NP-hardness and NPO-hardness are also explored.
In text/plain format

Archived Files and Locations

application/pdf  203.2 kB
file_uzo5ngwtgjetlbpmu5gzaxtyla
arxiv.org (repository)
web.archive.org (webarchive)
application/pdf  199.3 kB
file_2naktaevwfh7pihqtitlhogg7u
archive.org (archive)
Read Archived PDF
Preserved and Accessible
Type  article
Stage   submitted
Date   2012-02-17
Version   v4
Language   en ?
arXiv  1107.2722v4
Work Entity
access all versions, variants, and formats of this works (eg, pre-prints)
Catalog Record
Revision: 4e390d71-9478-4295-94f1-a4aa366b33e5
API URL: JSON