Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs
نویسندگان
چکیده
منابع مشابه
Minimum convex piecewise linear cost tension problem on quasi-k series-parallel graphs
This article proposes an extension, combined with the out-of-kilter technique, of the aggregation method (that solves the minimum convex piecewise linear cost tension problem, or CPLCT, on series-parallel graphs) to solve CPLCT on quasi series-parallel graphs. To make this algorithm efficient, the key point is to find a "good" way of decomposing the graph into series-parallel subgraphs. Decompo...
متن کاملMinimum convex-cost tension problems on series-parallel graphs
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 t...
متن کاملMinimum Linear Arrangement of Series-Parallel Graphs
We present a factor 14D approximation algorithm for the minimum linear arrangement problem on series-parallel graphs, where D is the maximum degree in the graph. Given a suitable decomposition of the graph, our algorithm runs in time O(|E|) and is very easy to implement. Its divide-andconquer approach allows for an effective parallelization. Note that a suitable decomposition can also be comput...
متن کاملMinimum Linear Gossip Graphs and Maximal Linear ( ; k)-Gossip Graphs
Gossiping is an information dissemination problem in which each node of a communication network has a unique piece of information that must be transmitted to all other nodes using two-way communications between pairs of nodes along the communication links of the network. In this paper, we study gossiping using a linear cost model of communication which includes a start-up time and a propagation...
متن کاملConvex piecewise-linear fitting
We consider the problem of fitting a convex piecewise-linear function, with some specified form, to given multi-dimensional data. Except for a few special cases, this problem is hard to solve exactly, so we focus on heuristic methods that find locally optimal fits. The method we describe, which is a variation on the K-means algorithm for clustering, seems to work well in practice, at least on d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: 4OR
سال: 2004
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-004-0049-3