3874 search results - page 202 / 775 » Approximation Algorithms for k-hurdle Problems |
136
click to vote
COCOON
2005
Springer
15 years 9 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...
119
click to vote
SODA
2003
ACM
15 years 5 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...
139
click to vote
ISAAC
2004
Springer
15 years 9 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...
114
click to vote
ESA
2003
Springer
15 years 9 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
139
click to vote
ISAAC
2003
Springer
15 years 9 months ago
2003
Springer
Abstract Given an edge-weighted transportation network G and a list of transportation requests L, the Stacker Crane Problem is to find a minimum-cost tour for a server along the e...