Optimal concave costs in the SDH context - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2004

Optimal concave costs in the SDH context

Jérôme Galtier
  • Function : Author
Stéphane Pérennes
  • Function : Author
  • PersonId : 942945


We address a problem of network design with minimum cost, and uniform all-to-all demands between the vertices. We deal with the case of concave increasing link cost function f depending of the capacity over directed arcs. We obtain lower bounds for this problem. In the generic case $f:x\mapsto x^\alpha$, where $\alpha\in[0;1]$, we exhibit some families that constitute an 1.12 asymptotical approximation of the optimal network.


Other [cs.OH]
Fichier principal
Vignette du fichier
RR-5201.pdf (255.56 Ko) Télécharger le fichier

Dates and versions

inria-00070791 , version 1 (19-05-2006)


  • HAL Id : inria-00070791 , version 1


Sébastien Choplin, Jérôme Galtier, Stéphane Pérennes. Optimal concave costs in the SDH context. RR-5201, INRIA. 2004, pp.11. ⟨inria-00070791⟩
267 View
111 Download


Gmail Facebook Twitter LinkedIn More