Sciweavers

47 search results - page 4 / 10
» Integrality gaps for Sherali-Adams relaxations
Sort
View
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 7 months ago
Grothendieck inequalities for semidefinite programs with rank constraint
Grothendieck inequalities are fundamental inequalities which are frequently used in many areas of mathematics and computer science. They can be interpreted as upper bounds for the ...
Jop Briët, Fernando Mário de Oliveira ...
STOC
2009
ACM
160views Algorithms» more  STOC 2009»
14 years 8 months ago
CSP gaps and reductions in the lasserre hierarchy
We study integrality gaps for SDP relaxations of constraint satisfaction problems, in the hierarchy of SDPs defined by Lasserre. Schoenebeck [25] recently showed the first integra...
Madhur Tulsiani
STOC
1993
ACM
179views Algorithms» more  STOC 1993»
13 years 11 months ago
The network inhibition problem
We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integr...
Cynthia A. Phillips
STOC
1999
ACM
125views Algorithms» more  STOC 1999»
13 years 11 months ago
Rounding Algorithms for a Geometric Embedding of Minimum Multiway Cut
Given an undirected graph with edge costs and a subset of k ≥ 3 nodes called terminals, a multiway, or k-way, cut is a subset of the edges whose removal disconnects each termina...
David R. Karger, Philip N. Klein, Clifford Stein, ...
FOCS
2008
IEEE
13 years 8 months ago
On the Approximability of Budgeted Allocations and Improved Lower Bounds for Submodular Welfare Maximization and GAP
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
Deeparnab Chakrabarty, Gagan Goel