Sandwich and probe problems for excluding paths
Abstract
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.
Collections
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
Other formats
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
Related items
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 ... -
A Lagrangean Relaxation and A Heuristic for the Pooling Problem
Almutairi, Hossa (University of Waterloo, 2008-01-25)The pooling problem is one of the fundamental optimization problems encountered in the petroleum industry. In the pooling problem, final products are produced using two stages of blending operations. In the first stage, ... -
On Geometric Range Searching, Approximate Counting and Depth Problems
Afshani, Peyman (University of Waterloo, 2008-09-24)In this thesis we deal with problems connected to range searching, which is one of the central areas of computational geometry. The dominant problems in this area are halfspace range searching, simplex range searching ...