12519 search results - page 71 / 2504 » Approximation Problems Categories |
143
click to vote
SIAMCOMP
2008
15 years 2 months ago
2008
We develop approximation algorithms for the problem of placing replicated data in arbitrary networks, where the nodes may both issue requests for data objects and have capacity fo...
125
click to vote
COCOON
2003
Springer
15 years 8 months ago
2003
Springer
Abstract. While the original stable marriage problem requires all participants to rank all members of the opposite sex in a strict order, two natural variations are to allow for in...
167
click to vote
IPCO
2001
15 years 4 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
145
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
200
click to vote
SIGECOM
2011
ACM
14 years 5 months ago
2011
ACM
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...