Moonen, Linda S.

Partitioning a weighted partial order by Linda S Moonen( Book )

3 editions published between 2005 and 2006 in English and Undetermined and held by 4 WorldCat member libraries worldwide

The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not only assume that the chains have bounded size, but also that a weight wi is given for each element i in the partial order such that wi lt; wj if i lt; j The problem is then to partition the partial order into a minimum-weight set of chains of bounded size, where the weight of a chain equals the weight of the heaviest element in the chain. We prove that this problem is APX-hard, and we propose and analyze lower bounds for this problem. Based on these lower bounds, we exhibit a 2-approximation algorithm, and show that it is tight. We report computational results for a number of real-world and randomly generated problem instances

Partitioning a permutation graph : algorithms and an application by Linda S Moonen( Book )

3 editions published in 2003 in English and held by 4 WorldCat member libraries worldwide

Connectivity measures for internet topologies( Book )

1 edition published in 2005 in English and held by 1 WorldCat member library worldwide

The tool switching problem revisited( Book )

1 edition published in 2005 in English and held by 1 WorldCat member library worldwide

Connectivity measures for internet topologies by Thomas Erlebach( Book )

1 edition published in 2005 in English and held by 1 WorldCat member library worldwide

Partitioning a weighted partial order by Linda S Moonen( Book )

1 edition published in 2005 in English and held by 1 WorldCat member library worldwide

The tool switching problem revisited by Yves Crama( Book )

1 edition published in 2005 in English and held by 1 WorldCat member library worldwide