2957 search results - page 132 / 592 » The Complexity of Polynomial-Time Approximation |
127
click to vote
COCOA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
133
Voted
DCOSS
2009
Springer
15 years 11 months ago
2009
Springer
We consider dual classes of geometric coverage problems, in which disks, corresponding to coverage regions of sensors, are used to cover a region or set of points in the plane. The...
130
click to vote
COMPGEOM
2009
ACM
15 years 11 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
150
click to vote
ICALP
1999
Springer
15 years 9 months ago
1999
Springer
The original stable marriage problem requires all men and women to submit a complete and strictly ordered preference list. This is obviously often unrealistic in practice, and seve...
128
click to vote
UAI
2004
15 years 6 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...