2752 search results - page 1 / 551 » Rounding to an Integral Program |
WEA
2005
Springer
14 years 4 months ago
2005
Springer
We present a general framework for approximating several NP-hard problems that have two underlying properties in common. First, the problems we consider can be formulated as intege...
COCO
2007
Springer
14 years 5 months ago
2007
Springer
We study semidefinite programming relaxations of Vertex Cover arising from repeated applications of the LS+ “lift-and-project” method of Lovasz and Schrijver starting from th...
JMLR
2010
13 years 9 months ago
2010
The problem of computing a maximum a posteriori (MAP) configuration is a central computational challenge associated with Markov random fields. There has been some focus on “tr...
STOC
2007
ACM
14 years 11 months ago
2007
ACM
We study linear programming relaxations of Vertex Cover and Max Cut arising from repeated applications of the "lift-and-project" method of Lovasz and Schrijver starting ...
SODA
2010
ACM
14 years 8 months ago
2010
ACM
We consider the problem of testing whether the maximum additive integrality gap of a family of integer programs in standard form is bounded by a given constant. This can be viewed...