270 search results - page 9 / 54 » Constraint relaxation in approximate linear programs |
CORR
2010
Springer
13 years 4 months ago
2010
Springer
The lift-and-project closure is the relaxation obtained by computing all lift-and-project cuts from the initial formulation of a mixed integer linear program or equivalently by co...
SIAMSC
2010
13 years 5 months ago
2010
Abstract. A problem that arises in slice-selective magnetic resonance imaging (MRI) radiofrequency (RF) excitation pulse design is abstracted as a novel linear inverse problem with...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...
SAC
2010
ACM
14 years 2 months ago
2010
ACM
We introduce an extension of linear constraints, called linearrange constraints, which allows for (meta-)reasoning about the approximation width of variables. Semantics for linear...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...