On the circuit diameter of some combinatorial polytopes

Sean Kafer, Kanstantsin Pashkovich, Laura Sanita

Research output: Contribution to journalArticleAcademicpeer-review

4 Citations (Scopus)

Abstract

The combinatorial diameter of a polytope P is the maximum value of a shortest path between two vertices of P, where the path uses the edges of P only. In contrast to the combinatorial diameter, the circuit diameter of P is defined as the maximum value of a shortest path between two vertices of P, where the path uses potential edge directions of P, i.e., all edge directions that can arise by translating some of the facets of P. In this paper, we study the circuit diameter of polytopes corresponding to classical combinatorial optimization problems, such as the matching polytope, the Traveling Salesman polytope, and the fractional stable set polytope.

Original languageEnglish
Pages (from-to)1-25
Number of pages25
JournalSIAM Journal on Discrete Mathematics
Volume33
Issue number1
DOIs
Publication statusPublished - 2019
Externally publishedYes

Keywords

  • Circuits
  • Combinatorial
  • Diameter
  • polytopes
  • Traveling Salesman
  • Vertices

Fingerprint

Dive into the research topics of 'On the circuit diameter of some combinatorial polytopes'. Together they form a unique fingerprint.

Cite this