791 search results - page 25 / 159 » Approximating the Maximum Sharing Problem |
134
Voted
NETWORKS
2006
15 years 2 months ago
2006
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...
125
Voted
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...
119
Voted
APPROX
2010
Springer
15 years 4 months ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
136
Voted
JAL
2006
15 years 2 months ago
2006
: We consider a variety of vehicle routing problems. The input to a problem consists of a graph G = (N, E) and edge lengths l(e) e E. Customers located at the vertices have to be ...
118
Voted
ICASSP
2008
IEEE
15 years 9 months ago
2008
IEEE
We consider the problem of learning multiscale graphical models. Given a collection of variables along with covariance specifications for these variables, we introduce hidden var...