On the combinatorial structure of chromatic scheduling polytopes

  • Authors:

  • Javier Marenco;Annegret Wagler

  • Affiliations:

  • Computer Science Dept., FCEN, University of Buenos Aires, Pabellón I, Buenos Aires, Argentina and Sciences Institute, National University of General Sarmiento, J. M. Gutiérrez y J. Verdi ...;Institute for Mathematical Optimization, Faculty for Mathematics, Otto-von-Guericke University of Magdeburg, Magdeburg, Germany

  • Venue:
  • Discrete Applied Mathematics - Special issue: Traces of the Latin American conference on combinatorics, graphs and applications: a selection of papers from LACGA 2004, Santiago, Chile
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Chromatic scheduling polytopes arise as solution sets of the bandwidth allocation problem in certain radio access networks, supplying wireless access to voice/data communication networks for customers with individual communication demands. To maintain the links, only frequencies from a certain spectrum can be used, which typically causes capacity problems. Hence it is necessary to reuse frequencies but no interference must be caused by this reuse. This leads to the bandwidth allocation problem, a special case of so-called chromatic scheduling problems. Both problems are NP-hard, and there do not even exist polynomial time algorithms with a fixed quality guarantee.As algorithms based on cutting planes have shown to be successful for many other combinatorial optimization problems, the goal is to apply such methods to the bandwidth allocation problem. For that, knowledge on the associated polytopes is required. The present paper contributes to this issue, exploring the combinatorial structure of chromatic scheduling polytopes for increasing frequency spans. We observe that the polytopes pass through various stages--emptyness, non-emptyness but low-dimensionality, full-dimensionality but combinatorial instability, and combinatorial stability--as the frequency span increases. We discuss the thresholds for this increasing "quantity" giving rise to a new combinatorial "quality" of the polytopes, and we prove bounds on these thresholds. In particular, we prove combinatorial equivalence of chromatic scheduling polytopes for large frequency spans and we establish relations to the linear ordering polytope.