355 search results - page 8 / 71 » A New Approximation Technique for Resource-Allocation Proble... |
87
Voted
AML
2008
14 years 9 months ago
2008
The basic motivation behind this work is to tie together various computational complexity classes, whether over different domains such as the naturals or the reals, or whether def...
78
Voted
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
73
Voted
EMSOFT
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Advances in VLSI technology have lead to a tremendous increase in the density and number of devices that can be manufactured in a single microchip. One of the interesting...
91
Voted
WADS
2005
Springer
15 years 3 months ago
2005
Springer
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for â...
72
Voted
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We propose a quasi-greedy algorithm for approximating the classical uncapacitated 2-level facility location problem (2-LFLP). Our algorithm, unlike the standard greedy algorithm, ...