3875 search results - page 236 / 775 » Approximation algorithms for the 0-extension problem |
171
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...
161
click to vote
DAGSTUHL
2004
15 years 7 months ago
2004
We study the intrinsic difficulty of solving linear parabolic initial value problems numerically at a single point. We present a worst case analysis for deterministic as well as fo...
163
Voted
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The infrastructure for mobile distributed tasks is often formed by cellular networks. One of the major issues in such networks is interference. In this paper we tackle in...
152
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...
167
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
We study Pareto optimal matchings in the context of house allocation problems. We present an O( √ nm) algorithm, based on Gale’s Top Trading Cycles Method, for finding a maxim...