-

 

 

 




Optimization Online





 

Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs

Friedrich Eisenbrand (eisen***at***mpi-sb.mpg.de)
Gianpaolo Oriolo (oriolo***at***disp.uniroma2.it)
Gautier Stauffer (gautier.stauffer***at***epfl.ch)
Paolo Ventura (ventura***at***iasi.rm.cnr.it)

Abstract: It is a long standing open problem to find an explicit description of the stable set polytope of claw-free graphs. Yet more than 20 years after the discovery of a polynomial algorithm for the maximum stable set problem for claw-free graphs, there is even no conjecture at hand today. Such a conjecture exists for the class of quasi-line graphs. This class of graphs is a proper superclass of line graphs and a proper subclass of claw-free graphs for which it is known that not all facets have 0/1 normal vectors. Ben Rebea's conjecture states that the stable set polytope of a quasi-line graph is completely described by clique-family inequalities. Chudnovsky and Seymour recently provided a decomposition result for claw-free graphs and proved that Ben Rebea's conjecture holds, if the quasi-line graph is not a fuzzy circular interval graph. In this paper, we give a proof of Ben Rebea's conjecture by showing that it also holds for fuzzy circular interval graphs. Our result builds upon an algorithm of Bartholdi, Orlin and Ratliff which is concerned with integer programs defined by circular ones matrices.

Keywords:

Category 1: Combinatorial Optimization (Polyhedra )

Citation: Report number RO161104 EPFL-SB-IMA-ROSO november 2004

Download: [PDF]

Entry Submitted: 11/16/2004
Entry Accepted: 11/16/2004
Entry Last Modified: 11/17/2004

Modify/Update this entry


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

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society