1332 search results - page 24 / 267 » Combinatorial Algorithms |
CG
2004
Springer
14 years 22 days ago
2004
Springer
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
GECCO
2005
Springer
14 years 2 months ago
2005
Springer
Many non-cooperative settings that could potentially be studied using game theory are characterized by having very large strategy spaces and payoffs that are costly to compute. Be...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
SODA
2010
ACM
13 years 6 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
FCT
2007
Springer
14 years 3 months ago
2007
Springer
We present new combinatorial approximation algorithms for k-set cover. Previous approaches are based on extending the greedy algorithm by efficiently handling small sets. The new a...