5595 search results - page 349 / 1119 » Approximation Algorithms for Clustering Problems |
239
click to vote
FAW
2010
Springer
15 years 7 months ago
2010
Springer
We study the minimum diameter color-spanning set problem which has recently drawn some attention in the database community. We show that the problem can be solved in polynomial tim...
172
click to vote
IPL
2008
15 years 6 months ago
2008
Max-SAT-CC is the following optimization problem: Given a formula in CNF and a bound k, find an assignment with at most k variables being set to true that maximizes the number of ...
190
click to vote
JMLR
2012
13 years 9 months ago
2012
Bisubmodularity extends the concept of submodularity to set functions with two arguments. We show how bisubmodular maximization leads to richer value-of-information problems, usin...
178
Voted
SIGMOD
2008
ACM
15 years 6 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
200
click to vote
WAOA
2005
Springer
16 years 6 days ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...