On the Parameterized Complexity of Reconfiguration Problems

We present the first results on the parameterized complexity of reconfiguration problems, where a reconfiguration variant of an optimization problem Q takes as input two feasible solutions S and T and determines if there is a sequence of reconfiguration steps, i.e. a reconfiguration sequence, that c...

Full description

Saved in:

Bibliographic Details
Published in:	Algorithmica Vol. 78; no. 1; pp. 274 - 297
Main Authors:	Mouawad, Amer E., Nishimura, Naomi, Raman, Venkatesh, Simjour, Narges, Suzuki, Akira
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.05.2017 Springer Nature B.V
Subjects:	Algorithm Analysis and Problem Complexity Algorithms Apexes Complexity Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graph theory Mathematics of Computing Optimization Parameterization Reconfiguration Theory of Computation Vertex sets Vertex cover Hitting set Solution space Parameterized complexity Reconfiguration
ISSN:	0178-4617, 1432-0541
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!