We consider the following problem: given a set of points in the plane, each with a weight, and capacities of the four quadrants, assign each point to one of the quadrants such that the total weight of points assigned to a quadrant does not exceed its capacity, and the total distance is minimized.
This problem is most important in placement of VLSI circuits and is likely to have other applications. It is NP-hard, but the fractional relaxation always has an optimal solution which is “almost” integral. Hence for large instances, it suffices to solve the fractional relaxation. The main result of this paper is a linear-time algorithm for this relaxation. It is based on a structure theorem describing optimal solutions by so-called “American maps” and makes sophisticated use of binary search techniques and weighted median computations.
This algorithm is a main subroutine of a VLSI placement tool that is used for the design of many of the most complex chips. 相似文献
Robust speed control of a low damped electromechanical system with backlash is studied, controlled load angular speed being not measured. The proposed control strategy combines a Luenberger observer (load angular speed and load torque disturbance estimations) and a robust CRONE controller. The observer provides estimation of the load angular speed and of the disturbance torque applied on the load. Through the computation of only three independent parameters (as many as a PID controller), the CRONE controller permits to ensure the robust speed control of the load in spite of plant parametric variations and speed observation errors. The proposed control strategy is applied to a four mass experimental test bench. 相似文献