We present polynomial-time algorithms and hardness reductions for several modifications of the plumber problem.
