On the parameterized complexity of dynamic problems
type: Item
instance of: scholarly article
title: On the parameterized complexity of dynamic problems
zbMATH Open document ID: 1333.68130
author: N. E. Zubov
published in: Theoretical Computer Science
publication date: 2015-12-11T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 68Q17
zbMATH DE Number: 6520519
zbMATH Keywords: dynamic problems
zbMATH Keywords: re-optimization
zbMATH Keywords: dynamic connected dominating set
zbMATH Keywords: parameterized complexity
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.06.053
OpenAlex ID: W815725825
cites work: An exact algorithm for connected red-blue dominating set
cites work: Reoptimization of Steiner trees: changing the terminal set
cites work: Monads for incremental computing
cites work: Q5074183
cites work: Q4027320
cites work: Q4393480
cites work: Incremental list coloring of graphs, parameterized by conservation
cites work: Enumerate and expand: Improved algorithms for connected vertex cover and tree cover
cites work: Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems
cites work: Dynamic vehicle routing: Status and prospects
cites work: A Theory and Algorithms for Combinatorial Reoptimization
DOI: 10.1016/J.TCS.2015.06.053
description: scientific article; zbMATH DE number 6520519