In this column we review the following books. 1. Model Checking by Edmund M. Clarke, Jr., Orna Grumberg, and Doron A. Peled. Review by Vicky Weissman. This is both an introductory text and aâ€¦ (More)

This is a survey on the algorithms which are part ofa program for flat placement of large-scale VLSI processorchips. The basis is a quadratic optimization approachcombined with a new quadrisectionâ€¦ (More)

We prove new results for approximating the graphic TSP and some related problems. We obtain polynomial-time algorithms with improved approximation guarantees. For the graphic TSP itself, we improveâ€¦ (More)

We prove: The directed edge-disjoint paths problem is NP-complete, even if (a) the underlying graph G is acyclic, the demand graph H consists just of three sets of parallel edges and G + H isâ€¦ (More)

We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes all previouslyâ€¦ (More)

BonnPlace is the placement tool of the University of Bonn, Germany. It is continuously used in the industry for the placement of most complex chips. Global placement is based on quadratic placementâ€¦ (More)

Most tools for the placement of very large scale integrated chips work in two steps. First, the cells that have to be placed are roughly spread out over the chip area, ignoring disjointness (globalâ€¦ (More)

Many recent approximation algorithms for different variants of the traveling salesman problem (asymmetric TSP, graph TSP, s-t-path TSP) exploit the well-known fact that a solution of the naturalâ€¦ (More)