Improved bottleneck domination algorithms

Bottleneck Domination and Bottleneck Independent Domination on Graphs

In this paper, the bottleneck dominating set problem and one of its variants, the bottleneck independent dominating set problem, are considered. Let G(V, E, W) denote a graph with n-vertex-set V and m-edge-set E, where each vertex v is associated with a real cost W(v). Given any subset V′ of V, the bottleneck cost of V′ is defined as max{W(x)  x ∈ V′}. The major task involves identifying a dom...

Improved Tree Decomposition Based Algorithms for Domination-like Problems

Improved Tree Decomposition Based Algorithms for Domination-like Problems

Algorithms with large domination ratio

Let P be an optimization problem, and let A be an approximation algorithm for P . The domination ratio domr(A,n) is the maximum real q such that the solution x(I) obtained by A for any instance I of P of size n is not worse than at least a fraction q of the feasible solutions of I. We describe a deterministic, polynomial time algorithm with domination ratio 1−o(1) for the partition problem, and...

Throughput Maximization by Improved Bottleneck Control

In many cases, optimal operation for a plant is the same as maximum throughput. In this case a rigorous model for the plant is not necessary if we are able to identify the bottleneck. Optimal operation is the same as maximum throughput in the bottleneck. If the bottleneck does not move, this can be realized with singleloop controller from the throughput manipulator to the bottleneck. However, i...