On Local Fixing

  • Michael König
  • Roger Wattenhofer
Conference paper

DOI: 10.1007/978-3-319-03850-6_14

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8304)
Cite this paper as:
König M., Wattenhofer R. (2013) On Local Fixing. In: Baldoni R., Nisse N., van Steen M. (eds) Principles of Distributed Systems. OPODIS 2013. Lecture Notes in Computer Science, vol 8304. Springer, Cham

Abstract

In this paper we look at the difficulty of fixing solutions of classic network problems. We study local changes in graphs (edge resp. node insertion resp. deletion), and network problems (e.g. maximal independent set, minimum vertex cover, spanning trees, shortest paths). A change/problem combination is locally fixable if an existing solution of a problem can be fixed in constant time in case of a local change in the graph. We analyze a variety of well-studied classic network problems with different characteristics.

Keywords

Local Fixing Fault Tolerance Graph Problems Complexity Classes and Maximal Independent Set 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer International Publishing Switzerland 2013

Authors and Affiliations

  • Michael König
    • 1
  • Roger Wattenhofer
    • 1
  1. 1.Computer Engineering and Networks LaboratoryETH ZurichZurichSwitzerland

Personalised recommendations