Incremental Problems in the Parameterized Complexity Setting

Mans, B; Mathieson, L

Incremental Problems in the Parameterized Complexity Setting

Mans, B Mathieson, L

Permalink

Publication Type:: Journal Article
Citation:: Theory of Computing Systems, 2017, 60 (1), pp. 3 - 19
Issue Date:: 2017-01-01

Closed Access

	Filename	Description	Size
	10.1007%2Fs00224-016-9729-6.pdf	Published Version	256.93 kB	Adobe PDF	View/Open

Copyright Clearance Process

Recently Added
In Progress
Closed Access

This item is closed access and not available.

Full metadata record

Field	Value	Language
dc.contributor.author	Mans, B	en_US
dc.contributor.author	Mathieson, L https://orcid.org/0000-0001-6470-2296	en_US
dc.date.issued	2017-01-01	en_US
dc.identifier.citation	Theory of Computing Systems, 2017, 60 (1), pp. 3 - 19	en_US
dc.identifier.issn	1432-4350	en_US
dc.identifier.uri	http://hdl.handle.net/10453/124918
dc.description.abstract	© 2016, Springer Science+Business Media New York. Dynamic systems are becoming steadily more important with the profusion of mobile and distributed computing devices. Coincidentally incremental computation is a natural approach to deal with ongoing changes. We explore incremental computation in the parameterized complexity setting and show that incrementalization leads to non-trivial complexity classifications. Interestingly, some incremental versions of hard problems become tractable, while others remain hard. Moreover tractability or intractability is not a simple function of the problem’s static complexity, every level of the W-hierarchy exhibits complete problems with both tractable and intractable incrementalizations. For problems that are already tractable in their static form, we also show that incrementalization can lead to interesting algorithms, improving upon the trivial approach of using the static algorithm at each step.	en_US
dc.relation.ispartof	Theory of Computing Systems	en_US
dc.relation.isbasedon	10.1007/s00224-016-9729-6	en_US
dc.subject.classification	Computation Theory & Mathematics	en_US
dc.title	Incremental Problems in the Parameterized Complexity Setting	en_US
dc.type	Journal Article
utslib.citation.volume	1	en_US
utslib.citation.volume	60	en_US
utslib.for	0102 Applied Mathematics	en_US
utslib.for	0802 Computation Theory and Mathematics	en_US
utslib.for	0805 Distributed Computing	en_US
pubs.embargo.period	Not known	en_US
pubs.organisational-group	/University of Technology Sydney
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology
pubs.organisational-group	/University of Technology Sydney/Faculty of Engineering and Information Technology/School of Computer Science
utslib.copyright.status	closed_access
pubs.issue	1	en_US
pubs.publication-status	Published	en_US
pubs.volume	60	en_US

Abstract:

© 2016, Springer Science+Business Media New York. Dynamic systems are becoming steadily more important with the profusion of mobile and distributed computing devices. Coincidentally incremental computation is a natural approach to deal with ongoing changes. We explore incremental computation in the parameterized complexity setting and show that incrementalization leads to non-trivial complexity classifications. Interestingly, some incremental versions of hard problems become tractable, while others remain hard. Moreover tractability or intractability is not a simple function of the problem’s static complexity, every level of the W-hierarchy exhibits complete problems with both tractable and intractable incrementalizations. For problems that are already tractable in their static form, we also show that incrementalization can lead to interesting algorithms, improving upon the trivial approach of using the static algorithm at each step.

Please use this identifier to cite or link to this item:

http://hdl.handle.net/10453/124918