Volume 37, Number 4, October-December 2003ROADEF 2002
|Page(s)||221 - 234|
|Published online||15 March 2004|
Minimum convex-cost tension problems on series-parallel graphs
LIMOS, UMR 6158-CNRS, Université Blaise-Pascal,
BP 10125, 63173 Aubière, France; firstname.lastname@example.org., email@example.com.
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(m3) operations.
Key words: Minimum cost tension / convex piecewise linear costs / series-parallel graphs.
© EDP Sciences, 2003
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.