5595 search results - page 174 / 1119 » Approximation Algorithms for Clustering Problems |
134
click to vote
IPCCC
2007
IEEE
15 years 11 months ago
2007
IEEE
In this paper, we study the Maximum lifetime Target Coverage problem (MTC), which is to maximize the network lifetime while guaranteeing the complete coverage of all the targets. ...
179
click to vote
FAW
2010
Springer
15 years 3 months ago
2010
Springer
The newsvendor problem describes the dilemma of a newspaper salesman—how many papers should he purchase each day to resell, when he doesn’t know the demand? We develop approach...
161
Voted
MOC
2002
15 years 4 months ago
2002
In this paper, we present several baby-step giant-step algorithms for the low hamming weight discrete logarithm problem. In this version of the discrete log problem, we are require...
150
Voted
CORR
2008
Springer
15 years 5 months ago
2008
Springer
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
154
click to vote
MCS
2001
Springer
15 years 9 months ago
2001
Springer
Abstract. Given an arbitrary data set, to which no particular parametrical, statistical or geometrical structure can be assumed, different clustering algorithms will in general pr...