Let us start with two examples. A company has a machine which drills holes into printed
circuit boards. Since it produces many of these boards it wants the machine to complete one …

This newly expanded and updated second edition of the best-selling classic continues to
take the" mystery" out of designing algorithms, and analyzing their efficacy and efficiency …

We present a polynomial time approximation scheme for Euclidean TSP in fixed dimensions.
For every fixed c> 1 and given any n nodes in ℛ2, a randomized version of the scheme finds …

This chapter surveys approximation algorithms for hard geometric problems. The problems
we consider typically take inputs that are point sets or polytopes in two-or three-dimensional …

Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

We present a polynomial time approximation scheme for Euclidean TSP in/spl Rfr//sup 2/.
Given any n nodes in the plane and/spl epsiv/> 0, the scheme finds a (1+/spl epsiv/) …

A natural and well-studied problem in algorithmic graph theory and network optimization is
that of computing a\shortest path" between two nodes, s and t, in a graph whose edges …

In this paper, we study the Steiner tree problem with minimum number of Steiner points and
bounded edge-length (STPMSPBEL), which asks for a tree interconnecting a given set of n …

" A very simple but instructive problem was treated by Jacob Steiner, the famous
representative of geometry at the University of Berlin in the early nineteenth century. Three …

This book focuses on the classic Steiner Problem and illustrates how results of the problem's
development have generated the Theory of Minimal Networks, that is systems of" rubber" …