Marzena Fügenschuh

Learn More
While semidefinite relaxations are known to deliver good approximations for combinatorial 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 or(More)
  • 1