867 search results - page 47 / 174 » The Generalized Maximum Coverage Problem |
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
ESA
2003
Springer
14 years 1 months ago
2003
Springer
The stable marriage problem has recently been studied in its general setting, where both ties and incomplete lists are allowed. It is NP-hard to find a stable matching of maximum ...
ANOR
2002
13 years 8 months ago
2002
Classical approaches to location problems are based on the minimization of the average distance (the median concept) or the minimization of the maximum distance (the center concept...
STOC
2009
ACM
14 years 8 months ago
2009
ACM
We design a linear time approximation scheme for the GaleBerlekamp Switching Game and generalize it to a wider class of dense fragile minimization problems including the Nearest C...
AAAI
2007
13 years 10 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...