5595 search results - page 130 / 1119 » Approximation Algorithms for Clustering Problems |
124
Voted
ESA
2008
Springer
15 years 6 months ago
2008
Springer
In the relay placement problem the input is a set of sensors and a number r 1, the communication range of a relay. In the one-tier version of the problem the objective is to place...
127
click to vote
ICDT
2005
ACM
15 years 10 months ago
2005
ACM
We present a formal analysis of the database layout problem, i.e., the problem of determining how database objects such as tables and indexes are assigned to disk drives. Optimizin...
141
click to vote
APPROX
2009
Springer
15 years 11 months ago
2009
Springer
We give the first constant factor approximation algorithm for the asymmetric Virtual Private Network (Vpn) problem with arbitrary concave costs. We even show the stronger result, ...
153
Voted
AAAI
2010
15 years 6 months ago
2010
Top-k approximate querying on string collections is an important data analysis tool for many applications, and it has been exhaustively studied. However, the scale of the problem ...
112
click to vote
JGAA
2006
15 years 4 months ago
2006
Two-dimensional phase unwrapping is the problem of deducing unambiguous "phase" from values known only modulo 2. Many authors agree that the objective of phase unwrappin...