12519 search results - page 228 / 2504 » Approximation Problems Categories |
195
click to vote
FOCS
1998
IEEE
15 years 10 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
194
click to vote
COCOON
2004
Springer
15 years 10 months ago
2004
Springer
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
188
click to vote
ALGORITHMICA
2010
15 years 6 months ago
2010
Abstract. We consider the variant of the classical Stable Marriage problem where preference lists can be incomplete and may contain ties. In such a setting, finding a stable matchi...
193
click to vote
JC
2011
15 years 1 months ago
2011
It has been an open problem to derive a necessary and sufficient condition for a linear tensor product problem S = {Sd} in the average case setting to be weakly tractable but not ...
166
click to vote
SIAMSC
2011
15 years 1 months ago
2011
We propose a numerical method to approximate the solution of second order elliptic problems in nonvariational form. The method is of Galerkin type using conforming finite elements...