#### Filter Results:

#### Publication Year

2005

2012

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

While semidefinite relaxations are known to deliver good approximations for com-binatorial optimization problems like graph bisection, their practical scope is mostly associated with small dense instances. For large sparse instances, cutting plane techniques are considered the method of choice. These are also applicable for semidefinite relaxations via the… (More)

Given a graph G = (V, E) with node weights ϕ v ∈ N ∪ {0}, v ∈ V , and some number F ∈ N∪{0}, the convex hull of the incidence vectors of all cuts δ(S), S ⊆ V with ϕ(S) ≤ F and ϕ(V \ S) ≤ F is called the bisection cut polytope. We study the facial structure of this polytope which shows up in many graph partitioning problems with applications in VLSI-design… (More)

- ‹
- 1
- ›