791 search results - page 50 / 159 » Approximating the Maximum Sharing Problem |
SIAMJO
2008
14 years 11 months ago
2008
We show that the optimal complexity of Nesterov's smooth first-order optimization algorithm is preserved when the gradient is only computed up to a small, uniformly bounded er...
NETWORKS
2007
14 years 11 months ago
2007
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...
CSDA
2006
14 years 12 months ago
2006
We propose a simulation-based method for calculating maximum likelihood estimators in latent variable models. The proposed method integrates a recently developed sampling strategy...
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
Given an undirected n-node graph and a set C of m cuts, the minimum crossing tree is a spanning tree which minimizes the maximum crossing of any cut in C, where the crossing of a c...
CORR
2006
Springer
14 years 12 months ago
2006
Springer
In the maximum constraint satisfaction problem (Max CSP), one is given a finite collection of (possibly weighted) constraints on overlapping sets of variables, and the goal is to ...