Sandwich and probe problems for excluding paths
MetadataShow full item record
Let Pk denote an induced path on k vertices. For k ≥ 5, we show that the Pk-free sandwich problem, partitioned probe problem, and unpartitioned probe problem are NP-complete. For k ≤ 4, it is known that the Pk-free sandwich problem, partitioned probe problem, and unpartitioned probe problem are in P.
Cite this version of the work
Celina Miraglia Herrera de Figueiredo, Sophie Spirkl (2018). Sandwich and probe problems for excluding paths. UWSpace. http://hdl.handle.net/10012/18596
The following license files are associated with this item:
Except where otherwise noted, this item's license is described as Attribution-NonCommercial-NoDerivatives 4.0 International
Showing items related by title, author, creator and subject.
Radiotherapy Cancer Treatment: Investigating Real-Time Position and Dose Control, the Sensor-Delayed Plant Output Estimation Problem, and the Nonovershooting Step Response Problem Stewart, James (University of Waterloo, 2006-12-18)For over a century, physicians have prescribed x-ray radiation to destroy or impede the growth of cancerous tumours. Modern radiation therapy machines shape the radiation beam to balance the competing goals of maximizing ...
Alternative Approaches for Analysis of Bin Packing and List Update Problems Kamali, Shahin (University of Waterloo, 2014-09-22)In this thesis we introduce and evaluate new algorithms and models for the analysis of online bin packing and list update problems. These are two classic online problems which are extensively studied in the literature and ...
Problem Determination In Message-Flow Internet Services Based On Statistical Analysis of Event Logs Xu, Yu (University of Waterloo, 2009-05-23)In a message-flow Internet service where messages travel through multiple nodes, event log analysis is one of the most important methods to identify the root causes of problems. Traditional approaches for event log analysis ...