Publication

On Sub-determinants and the Diameter of Polyhedra

Friedrich Eisenbrand, Martin Niemeier, Nicolai Hähnle, Marco Di Summa, Nicolas Bonifas
2014
Journal Articles

Abstract

We derive a new upper bound on the diameter of a polyhedron , where . The bound is polynomial in and the largest absolute value of a sub-determinant of , denoted by . More precisely, we show that the diameter of is bounded by . If is bounded, then we show that the diameter of is at most . For the special case in which is a totally unimodular matrix, the bounds are and respectively. This improves over the previous best bound of due to Dyer and Frieze (Math Program 64:1-16, 1994).

Official source

https://infoscience.epfl.ch/entities/publication/e4cac256-e902-4a9b-ac02-524476231774

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

On Sub-determinants and the Diameter of Polyhedra

Chat with Graph Search

Improving SAM Requires Rethinking its Optimization Formulation

The multivariate Serre conjecture ring

Linear Complexity Self-Attention With 3rd Order Polynomials