Optimization Online


The Hirsch Conjecture for the Fractional Stable Set Polytope

Carla Michini (michini***at***dis.uniroma1.it)
Antonio Sassano (sassano***at***dis.uniroma1.it)

Abstract: The edge formulation of the stable set problem is defined by two-variable constraints, one for each edge of a graph G, expressing the simple condition that two adjacent nodes cannot belong to a stable set. We study the fractional stable set polytope, i.e. the polytope defined by the linear relaxation of the edge formulation. Even if this polytope is a weak approximation of the stable set polytope, its simple geometrical structure provides deep theoretical insight as well as interesting algorithmic opportunities. Exploiting a graphic characterization of the bases, we first redefine simplex pivots in terms of simple graphic operations, that turn a given basis into an adjacent one. These results lead us to prove that the Hirsch Conjecture is true for the fractional stable set polytope, i.e. the combinatorial diameter of this fractional polytope is at most equal to the number of edges of the given graph.

Keywords: stable set, edge formulation, diameter

Category 1: Combinatorial Optimization (Polyhedra )

Category 2: Network Optimization

Citation: Sapienza University of Rome, June 2012


Entry Submitted: 06/08/2012
Entry Accepted: 06/08/2012
Entry Last Modified: 12/24/2013

Modify/Update this entry

  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository


Coordinator's Board
Classification Scheme
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Optimization Society