SIAMDM
2010
13 years 2 months ago
2010
A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect i...
SIAMDM
2010
13 years 2 months ago
2010
SIAMDM
2010
13 years 2 months ago
2010
Let s < t be two fixed positive integers. We study what are the minimum degree conditions for a bipartite graph G, with both color classes of size n = k(s + t), which ensure t...
SIAMDM
2010
13 years 2 months ago
2010
SIAMDM
2010
13 years 2 months ago
2010
SIAMDM
2010
13 years 2 months ago
2010
We study grooming for two-period optical networks, a variation of the traffic grooming problem for WDM ring networks introduced by Colbourn, Quattrocchi, and Syrotiuk. In the two-...
SIAMDM
2010
13 years 2 months ago
2010
SIAMDM
2010
13 years 2 months ago
2010
SIAMDM
2010
13 years 2 months ago
2010
Let ϕ = (1 + √ 5)/2 denote the golden section. We investigate relationships between unbounded iterations of the floor function applied to various combinations of ϕ and ϕ2. We...
SIAMDM
2010
13 years 2 months ago
2010
We consider the class of max-min and min-max optimization problems subject to a global budget (or weight) constraint and we undertake a systematic algorithmic and complexitytheore...