Minimum Convex-Cost Tension Problems on Series-Parallel Graphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue RAIRO - Operations Research Année : 2003

Minimum Convex-Cost Tension Problems on Series-Parallel Graphs

Résumé

We present briefly some results we obtained with known methods to solve minimum cost tension problems, comparing their performance on non-specific graphs and on series-parallel graphs. These graphs are shown to be of interest to approximate many tension problems, like synchronization in hypermedia documents. We propose a new aggregation method to solve the minimum convex piecewise linear cost tension problem on series-parallel graphs in O(m^3) operations.
Fichier principal
Vignette du fichier
RR-03-06.pdf (133.68 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00107129 , version 1 (16-01-2019)

Identifiants

Citer

Bruno Bachelet, Philippe Mahey. Minimum Convex-Cost Tension Problems on Series-Parallel Graphs. RAIRO - Operations Research, 2003, 37 (4), pp.221-234. ⟨10.1051/ro:2004202⟩. ⟨hal-00107129⟩
95 Consultations
62 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More