7930 search results - page 111 / 1586 » Greedy in Approximation Algorithms |
131
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
: In this paper we present several algorithmic techniques for inferring the structure of a company when only a limited amount of information is available. We consider problems with...
185
click to vote
ICDM
2005
IEEE
15 years 12 months ago
2005
IEEE
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
179
click to vote
WADS
2007
Springer
16 years 13 days ago
2007
Springer
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
142
click to vote
IPL
2006
15 years 6 months ago
2006
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...
147
click to vote
DAC
1996
ACM
15 years 10 months ago
1996
ACM
Approximation has been shown to be an eective method for reducing the time and space costs of solving various oorplan area minimization problems. In this paper, we present several...