Sciweavers

3874 search results - page 3 / 775
» Approximation Algorithms for k-hurdle Problems
Sort
View
AAIM
2007
Springer
141views Algorithms» more  AAIM 2007»
13 years 11 months ago
An Almost Linear Time 2.8334-Approximation Algorithm for the Disc Covering Problem
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
Bin Fu, Zhixiang Chen, Mahdi Abdelguerfi
IPL
2006
101views more  IPL 2006»
13 years 4 months ago
An efficient approximation for the Generalized Assignment Problem
We present a simple family of algorithms for solving the Generalized Assignment Problem (GAP). Our technique is based on a novel combinatorial translation of any algorithm for the...
Reuven Cohen, Liran Katzir, Danny Raz