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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Algorithmica Ročník 78; číslo 1; s. 274 - 297
Hlavní autori:	Mouawad, Amer E., Nishimura, Naomi, Raman, Venkatesh, Simjour, Narges, Suzuki, Akira
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.05.2017 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!