Take Action

Home | Faculty & Research Overview | Research

Research Details

Partitioning of Hypergraphs, Discrete Applied Mathematics

Abstract

Let H = (V, E) be an undirected hypergraph and Asubset of or equal toC. We consider the problem of finding a minimum cost partition of V that separates every pair of nodes in A. We consider three formulations of the problem and show that the theoretical lower bounds to the integer optimal objective value provided by the LP-relaxations in all three cases are identical. We describe our empiical findings with each formulation.

Type

Article

Author(s)

Sunil Chopra, Jonathan H. Owen

Date Published

1999

Citations

Chopra, Sunil, and Jonathan H. Owen. 1999. Partitioning of Hypergraphs. Discrete Applied Mathematics. 90(1-3): 115-133.

KELLOGG INSIGHT

Explore leading research and ideas

Find articles, podcast episodes, and videos that spark ideas in lifelong learners, and inspire those looking to advance in their careers.
learn more

COURSE CATALOG

Review Courses & Schedules

Access information about specific courses and their schedules by viewing the interactive course scheduler tool.
LEARN MORE

DEGREE PROGRAMS

Discover the path to your goals

Whether you choose our Full-Time, Part-Time or Executive MBA program, you’ll enjoy the same unparalleled education, exceptional faculty and distinctive culture.
learn more

Take Action