Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1051/ro:2004202 | RAIRO-OPERATIONS RESEARCH |
Keywords | Field | DocType |
minimum cost tension,convex piecewise linear costs,series-parallel graphs | Discrete mathematics,Graph,Combinatorics,Mathematical optimization,Synchronization,Hypermedia,Regular polygon,Series and parallel circuits,Piecewise linear function,Mathematics | Journal |
Volume | Issue | ISSN |
37 | 4 | 0399-0559 |
Citations | PageRank | References |
7 | 0.63 | 11 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Bruno Bachelet | 1 | 30 | 5.74 |
| Philippe Mahey | 2 | 174 | 20.95 |