We prove that Simulated Annealing with an appropriate cooling schedule computes arbitrarily tight constant-factor approximations to the minimum spanning tree problem in polynomial time. This result was conjectured by Wegener (2005). More precisely, denoting $n, m, w_{\max}$, and $w_{\min}$ number of vertices edges as well maximum edge weight MST instance, we simulated annealing initial temperat...

Background: CD8+ cytotoxic T lymphocytes have been recently divided based on their cytokine expression profile. Objective: To evaluate the percentages of CD8+ lymphocytes and their effector subsets including Tc1, Tc2 and Tc17 in the tumor draining lymph nodes (TDLNs) of patients with breast cancer. Methods: Single cell suspensions were obtained from TDLNs of 42 patients with breast cancer. Stai...

The median stabilization degree (msd, for short) of a median algebra measures the largest possible number of steps needed to generate a subalgebra with an arbitrary set of generators. With computer assistance, we found that msd of the lattice {−1, 0, 1}4 equals 2. This value is of critical importance to determine msd of {−1, 0, 1}n for all n ≥ 5 and to determine msd of the free median algebra λ...