497 search results - page 13 / 100 » Approximating max-min linear programs with local algorithms |
118
click to vote
CDC
2008
IEEE
15 years 4 months ago
2008
IEEE
— The assignment problem constitutes one of the fundamental problems in the context of linear programming. Besides its theoretical significance, its frequent appearance in the a...
VLSID
2007
IEEE
15 years 10 months ago
2007
IEEE
? We give a new recursive rounding linear programming (LP) solution to the problem of N-detect test minimzation. This is a polynomialtime solution that closely approximates the exa...
108
click to vote
MOR
2000
14 years 9 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
DCOSS
2010
Springer
15 years 1 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
FSTTCS
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Stochastic optimization is a leading approach to model optimization problems in which there is uncertainty in the input data, whether from measurement noise or an inabili...