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, and the assignment problem. Several heuristics are described in detail-and results are given for worst-case ratio bounds, abso
On the existence of weak greedy matching heuristics
β Scribed by M.D Grigoriadis; B Kalantari; C.Y Lai
- Publisher
- Elsevier Science
- Year
- 1986
- Tongue
- English
- Weight
- 480 KB
- Volume
- 5
- Category
- Article
- ISSN
- 0167-6377
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
This note gives a partial answer to a problem posed by Brian Alspach in a recent issue of Discrete Mathematics. We show that if F,, F2, . . . , Fd is a Zfactorixation of a w-regular graph G of order n 2 3.23 d then G contains a d-matching with exactly one edge from each of 44, . . ., 4.
Di!erential equations and boundary conditions which describe physical phenomena are often obtained from physical principles by means of the variational calculus techniques. The necessary conditions for the existence of extremes of a functional lead to the Euler di!erential equation which involves un
## Abstract It is shown, within constructive mathematics, that the unit ball B~1~(__H__) of the set of bounded operators on a Hilbert space __H__ is weakβoperator totally bounded. This result is then used to prove that the weakβoperator continuity of the mapping __T__ β __AT__ on __B__~1~(__H__) is