𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An Improved Approximation Algorithm for the Most Points Covering Problem

✍ Scribed by Hossein Ghasemalizadeh; Mohammadreza Razzazi

Publisher
Springer
Year
2011
Tongue
English
Weight
461 KB
Volume
50
Category
Article
ISSN
1433-0490

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Approximation algorithms for the test co
Approximation algorithms for the test cover problem
✍ K.M.J. De Bontridder; B.V. HalldΓ³rsson; M.M. HalldΓ³rsson; C.A.J. Hurkens; J.K. L πŸ“‚ Article πŸ“… 2003 πŸ› Springer-Verlag 🌐 English βš– 190 KB
An improved approximation algorithm for
An improved approximation algorithm for the partial Latin square extension problem
✍ Carla P. Gomes; Rommel G. Regis; David B. Shmoys πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 203 KB

The problem of completing partial latin squares arises in a number of applications, including conflict-free wavelength routing in wide-area optical networks, statistical designs, and error-correcting codes. A partial latin square is an n by n array such that each cell is either empty or contains exa