Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Given a undirected, weighted, complete graph $(V,E,c)$ with $c \to \mathbb{N}$ and $v_0 \in V$ we are looking for a set $E' \subset E$ minimal with respect to $c$ with the following conditions:

  • for each $v \in V$ there exactly two distinct edges in $E'$ which are adjacent to $v$
  • $v_0$ is reachable from each $v \in V$ with edges in $E'$

I'm interested if this is a formulation of the Traveling Salesman Problem or if this is weaker. It occurs in an exercise I do as exam preperation. The task is to encode it as a linear integer program.

share|cite|improve this question
up vote 2 down vote accepted

By 1st condition the subgraph on $E'$ is a (disjoint) union of cycles. By 2nd condition it is just one cycle. So this problem is equvivalent to Traveling Salesman Problem.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.