1161 search results - page 11 / 233 » Approximation schemes for clustering problems |
COCOA
2008
Springer
14 years 11 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
DAM
2006
14 years 9 months ago
2006
We address the classical knapsack problem and a variant in which an upper bound is imposed on the number of items that can be selected. We show that appropriate combinations of ro...
FCT
2003
Springer
15 years 2 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
COMGEO
2010
ACM
14 years 9 months ago
2010
ACM
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
ESA
2009
Springer
15 years 2 months ago
2009
Springer
Sponsored search auctions provide a marketplace where advertisers can bid for millions of advertising opportunities to promote their products. The main difficulty facing the adver...