5595 search results - page 86 / 1119 » Approximation Algorithms for Clustering Problems |
118
click to vote
CP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. The sub-optimality approximation problem considers an optimization problem O, its optimal solution σ∗ , and a variable x with domain {d1, . . . , dm} and returns appro...
158
click to vote
ESORICS
2005
Springer
15 years 10 months ago
2005
Springer
The freedom and transparency of information flow on the Internet has heightened concerns of privacy. Given a set of data items, clustering algorithms group similar items together...
130
click to vote
ESA
2010
Springer
15 years 5 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
127
click to vote
ALGORITHMICA
2004
15 years 4 months ago
2004
We present a framework for an automated generation of exact search tree algorithms for NP-hard problems. The purpose of our approach is two-fold--rapid development and improved up...
124
click to vote
TACAS
2010
Springer
15 years 9 months ago
2010
Springer
We propose a general methodology for approximating the Pareto front of multi-criteria optimization problems. Our search-based methodology consists of submitting queries to a constr...