Filters








166,816 Hits in 5.1 sec

On the Complexity of Reconfiguration Problems [chapter]

Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
2008 Lecture Notes in Computer Science  
In contrast, several reconfiguration versions of problems in P are solvable in polynomial time.  ...  We demonstrate that a host of reconfiguration problems derived from NP-complete problems are PSPACE-complete, while some are also NP-hard to approximate.  ...  Acknowledgements We thank the referees for their fruitful comments, one of which led us to an improvement of the approximation ratio for minmax power supply reconfiguration.  ... 
doi:10.1007/978-3-540-92182-0_6 fatcat:krdjr2lw25az3oflwqhssobmuy

On the complexity of reconfiguration problems

Takehiro Ito, Erik D. Demaine, Nicholas J.A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno
2011 Theoretical Computer Science  
In contrast, several reconfiguration versions of problems in P are solvable in polynomial time.  ...  We demonstrate that a host of reconfiguration problems derived from NP-complete problems are PSPACE-complete, while some are also NP-hard to approximate.  ...  Acknowledgements We thank the referees for their fruitful comments, one of which led us to an improvement of the approximation ratio for minmax power supply reconfiguration.  ... 
doi:10.1016/j.tcs.2010.12.005 fatcat:l7sg6nwunbht7ib6cx6efaa6ma

On the Parameterized Complexity of Reconfiguration Problems [chapter]

Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki
2013 Lecture Notes in Computer Science  
We present the first results on the parameterized complexity of reconfiguration problems, where a reconfiguration version of an optimization problem Q takes as input two feasible solutions S and T and  ...  Our study is motivated by recent results establishing that for most NP-hard problems, the classical complexity of reconfiguration is PSPACE-complete.  ...  The second author wishes to thank Marcin Kamiński for suggesting the examination of reconfiguration in the parameterized setting.  ... 
doi:10.1007/978-3-319-03898-8_24 fatcat:fg5zfk6ov5egtda4i2hqvhbocu

On the Parameterized Complexity of Reconfiguration Problems

Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki
2016 Algorithmica  
We present the first results on the parameterized complexity of reconfiguration problems, where a reconfiguration version of an optimization problem Q takes as input two feasible solutions S and T and  ...  Our study is motivated by recent results establishing that for most NP-hard problems, the classical complexity of reconfiguration is PSPACE-complete.  ...  The second author wishes to thank Marcin Kamiński for suggesting the examination of reconfiguration in the parameterized setting.  ... 
doi:10.1007/s00453-016-0159-2 fatcat:qretakdj4nhhtgipvk4fyjlhsq

On the Parameterized Complexity of Reconfiguration Problems [article]

Amer E. Mouawad, Naomi Nishimura, Venkatesh Raman, Narges Simjour, Akira Suzuki
2013 arXiv   pre-print
We present the first results on the parameterized complexity of reconfiguration problems, where a reconfiguration version of an optimization problem Q takes as input two feasible solutions S and T and  ...  Our study is motivated by recent results establishing that for most NP-hard problems, the classical complexity of reconfiguration is PSPACE-complete.  ...  Acknowledgements The second author wishes to thank Marcin Kamiński for suggesting the examination of reconfiguration in the parameterized setting.  ... 
arXiv:1308.2409v2 fatcat:sxnm5f7z6vafnnvk5rxytvkfby

The Complexity of Induced Tree Reconfiguration Problems

Kunihiro WASA, Katsuhisa YAMANAKA, Hiroki ARIMURA
2019 IEICE transactions on information and systems  
As the main results, we show that (I) the reconfiguration problem is PSPACE-complete even if the input graph is of bounded maximum degree, (II) the reconfiguration problem is W[1]-hard when parameterized  ...  by both the size of induced trees and the length of the reconfiguration sequence, and (III) there exists an FPT algorithm when the problem is parameterized by both the size of induced trees and the maximum  ...  We would also like to thank the anonymous reviewers for their comments and suggestions. This work was supported by JSPS KAKENHI Grant Number JP16K00002 and JST CREST Grant Number JPMJCR1401, Japan.  ... 
doi:10.1587/transinf.2018fcp0010 fatcat:um2snqhcord2xlkto5kif3gsbu

A survey on the parameterized complexity of the independent set and (connected) dominating set reconfiguration problems [article]

Nicolas Bousquet and Amer E. Mouawad and Naomi Nishimura and Sebastian Siebertz
2022 arXiv   pre-print
We survey both older and more recent work on the parameterized complexity of all three problems when parameterized by the number of tokens k.  ...  A reconfiguration variant of a vertex-subset problem asks, given two feasible solutions of size k, whether it is possible to transform one into the other by a sequence of token slides (along edges of the  ...  A A systematic study of the parameterized complexity of reconfiguration problems was initiated by Mouawad et al. [51] .  ... 
arXiv:2204.10526v1 fatcat:ua3pkqxtabatbbl6jydhy3i3b4

Introduction to Reconfiguration

Naomi Nishimura
2018 Algorithms  
Reconfiguration is concerned with relationships among solutions to a problem instance, where the reconfiguration of one solution to another is a sequence of steps such that each step produces an intermediate  ...  Work in the area encompasses both structural questions (Is the reconfiguration graph connected?) and algorithmic ones (How can one find the shortest sequence of steps between two solutions?)  ...  complexity of the source problem.  ... 
doi:10.3390/a11040052 fatcat:nmokeftdqrgtpdyh2ohl3tchce

On the complexity of optimal reconfiguration planning for modular reconfigurable robots

Feili Hou, Wei-Min Shen
2010 2010 IEEE International Conference on Robotics and Automation  
This paper presents a thorough analysis of the computational complexity of optimal reconfiguration planning problem for chain-type modular robots, i.e. finding the least number of reconfiguration steps  ...  To facilitate future evaluation of reconfiguration algorithms, the paper also provides the lower and the upper bounds for the minimum number of reconfiguration steps for any given reconfiguration problem  ...  Configuration Representation Before defining the optimal reconfiguration planning On the Complexity of Optimal Reconfiguration Planning for Modular Reconfigurable Robots Feili Hou, Wei-Min Shen C problem  ... 
doi:10.1109/robot.2010.5509642 dblp:conf/icra/HouS10 fatcat:bmljxgxjrrhing5r5qff4hf3ru

Improving PV Resilience by Dynamic Reconfiguration in Distribution Grids: Problem Complexity and Computation Requirements

Filipe F. C. Silva, Pedro M. S. Carvalho, Luís A. F. M. Ferreira
2021 Energies  
Given the need to quickly find and update reconfiguration decisions, the computational complexity of the underlying optimal scheduling problem is studied in this paper.  ...  The complexity of the scheduling problem is discussed to conclude that its optimal solution is infeasible in practical terms if relying upon classical computing.  ...  Problem Complexity and New Computation Paradigms Problem Time Complexity Number of Operations Operation Unrestricted optimal reconfiguration p optimization As an example, a time resolution on 15 min  ... 
doi:10.3390/en14040830 fatcat:36lkiawlivcv7bgrj2namb6mym

Research on the Safety Mechanism of Complex System Dynamic Reconfiguration Process

Fuchun Ren, Nuo Zhao, Tingdi Zhao, Zeyong Jiang
2017 DEStech Transactions on Engineering and Technology Research  
To promote the effective embedding of dynamic reconfiguration strategy, the safety mechanism of reconfiguration process is discussed in this paper, while some advises are finally provided based on the  ...  On the premise of ensuring reliable and successful operation of modern safetycritical system, dynamic reconfiguration technology is often needed for the expected or unexpected malfunction.  ...  problem of consistence and integrity, meanwhile the complicated behavior and dynamic feature of dynamic reconfiguration also brings some problems in the application process.  ... 
doi:10.12783/dtetr/mimece2016/10001 fatcat:qjntlwztszhlbnei6kyx4wc25e

A Discussion of Dynamic Configuration Technology of Highly Complex System in Information Era

Zeyong Jiang, Tingdi Zhao, Fuchun Ren, Nuo Zhao
2017 DEStech Transactions on Engineering and Technology Research  
However, dynamic reconfiguration technology provides new ideas and methods for security of complex system; meanwhile, it also brings the issues that system behavior tends to be more complex, so that it  ...  Dynamic reconfiguration technology has become a practical and effective solution to ensure safety operation of complex system through reconfiguration after a fault occurs in system.  ...  The security analysis and evaluation technology of dynamic reconfiguration system has become one of the important issues in the development of complex systems.  ... 
doi:10.12783/dtetr/mimece2016/10009 fatcat:kqn5fe5ehndkrd35dijx32qyoa

Shortest Paths between Shortest Paths and Independent Sets [chapter]

Marcin Kamiński, Paul Medvedev, Martin Milanič
2011 Lecture Notes in Computer Science  
We study problems of reconfiguration of shortest paths in graphs.  ...  We prove that the shortest reconfiguration sequence can be exponential in the size of the graph and that it is NP-hard to compute the shortest reconfiguration sequence even when we know that the sequence  ...  is poly-time → polynomial diameter of RG"  Open problem  what is the complexity of deciding if two shortest paths are reconfigurable?  ... 
doi:10.1007/978-3-642-19222-7_7 fatcat:p74psoxaxnbyddqverwupwwkju

The Decision Making Method for Reconfiguration of Adaptive Infocommunication Systems

Loginov I. V., Kuzichkin O. R., Eremenko V. T., Vasilyev G. S., Eremenko S. V., Surzhik D. I.
2021 Advances in dynamical systems and applications (ADSA)  
Other problem in the complex system reconfiguration is to determinate the moment of control action. To decide this problem the effective monitoring system is needed.  ...  For a complex reconfiguration problem multistage methods are proposed.  ... 
doi:10.37622/adsa/16.1.2021.335-353 fatcat:5euufok2xfh3xlnajdkelwxf6a

Special Issue on Reconfiguration Problems

Faisal Abu-Khzam, Henning Fernau, Ryuhei Uehara
2018 Algorithms  
The study of reconfiguration problems has grown into a field of its own.  ...  The solution space is often represented by a "reconfiguration graph", where vertices represent solutions to the problem in hand and an edge between two vertices means that one can be obtained from the  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/a11110187 fatcat:fjeoz36p3nbotih2flbsh6yblu
« Previous Showing results 1 — 15 out of 166,816 results