16596 search results - page 146 / 3320 » Generalized Assignment Problems |
137
click to vote
JCSS
2002
15 years 2 months ago
2002
We present the first constant-factor approximation algorithm for the metric k-median problem. The k-median problem is one of the most well-studied clustering problems, i.e., those...
123
Voted
ECAI
2006
Springer
15 years 4 months ago
2006
Springer
Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different applicati...
157
click to vote
TMC
2010
15 years 21 days ago
2010
—One important application of cooperative communications is to extend coverage area in wireless networks without increasing infrastructure. However, a crucial challenge in implem...
130
click to vote
CONSTRAINTS
2010
14 years 11 months ago
2010
Abstract. Propositional satisfiability (SAT) is a success story in Computer Science and Artificial Intelligence: SAT solvers are currently used to solve problems in many different ...
154
click to vote
ESA
2011
Springer
14 years 2 months ago
2011
Springer
We present a number of positive and negative results for variants of the matroid secretary problem. Most notably, we design a constant-factor competitive algorithm for the “rando...