12519 search results - page 267 / 2504 » Approximation Problems Categories |
170
click to vote
ALGOSENSORS
2010
Springer
15 years 5 months ago
2010
Springer
We study the problem of maximizing the lifetime of a sensor network assigned to monitor a given area. Our main result is a linear time dual approximation algorithm that comes arbit...
144
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...
169
click to vote
COCOON
2005
Springer
16 years 3 days ago
2005
Springer
The complexity, approximation and algorithmic issues of several clustering problems are studied. These non-traditional clustering problems arise from recent studies in microarray ...
194
click to vote
WWW
2004
ACM
16 years 7 months ago
2004
ACM
Web data integration is an important preprocessing step for web mining. It is highly likely that several records on the web whose textual representations differ may represent the ...
160
click to vote
CIKM
2003
Springer
15 years 11 months ago
2003
Springer
High dimensional data sets are encountered in many modern database applications. The usual approach is to construct a summary of the data set through a lossy compression technique...