This survey paper reviews results on heuristics for two weighted matching problems:
matchings where the vertices are points in the plane and weights are Euclidean distances …

Publisher Summary Matching is pairing: dividing a collection of objects into pairs. Typically
the objective is to maximize total profit (or minimize cost), where the profit of each possible …

This thesis deals with the polynomial approximability of combinatorial optimization problems
which are NP-complete in their decision problem version. Different measures of …

This monograph describes the stochastic behavior of the solutions to the classic problems of
Euclidean combinatorial optimization, computational geometry, and operations research …

On Optimal Interconnections for VLSI describes, from a geometric perspective, algorithms for
high-performance, high-density interconnections during the global and detailed routing …

In this paper we study the length of optimal paths for Dubins' vehicle, ie, a vehicle
constrained to move forward along paths of bounded curvature. First, we obtain an upper …

An extensive search of journal publications on heuristic methods and applications produced
442 articles published in 37 journals during the last sixteen years. A scheme is employed to …

The classical problems reviewed are the traveling salesman problem, minimal spanning
tree, minimal matching, greedy matching, minimal triangulation, and others. Each …

Minimizing clock skew is a very important problem in the design of high performance VLSI
systems. We present a general clock routing scheme that achieves extremely small clock …

Consider an equal number of mobile robotic agents and distinct target locations dispersed in
an environment. Each agent has a limited communication range and either: 1) knowledge of …