12519 search results - page 69 / 2504 » Approximation Problems Categories |
158
click to vote
FOCS
2006
IEEE
15 years 9 months ago
2006
IEEE
Combinatorial allocation problems require allocating items to players in a way that maximizes the total utility. Two such problems received attention recently, and were addressed ...
123
click to vote
STACS
2009
Springer
15 years 9 months ago
2009
Springer
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-conn...
118
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...
146
click to vote
CATS
2006
15 years 4 months ago
2006
We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number...
107
click to vote
WSC
2004
15 years 4 months ago
2004
The stochastic root-finding problem (SRFP) is that of solving a system of q equations in q unknowns using only an oracle that provides estimates of the function values. This paper...