A QUASI-POLYNOMIAL BOUND FOR THE DIAMETER OF GRAPHS OF POLYHEDRA

被引：68
|
作者：
KALAI, G
KLEITMAN, DJ
机构：
[1] IBM CORP,ALMADEN RES CTR,SAN JOSE,CA 95120
[2] MIT,DEPT MATH,CAMBRIDGE,MA 02139
来源：
BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY | 1992年 / 26卷 / 02期
关键词：
D O I：
10.1090/S0273-0979-1992-00285-9
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
The diameter of the graph of a d-dimensional polyhedron with n facets is at most n(log d + 2).
引用
收藏
页码：315 / 316
页数：2
相关论文
共 50 条
  • [1] A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor
    Levi, Reut
    Ron, Dana
    ACM TRANSACTIONS ON ALGORITHMS, 2015, 11 (03)
  • [2] ON QUASI-POLYNOMIAL ALGEBRAS
    ASANUMA, T
    JOURNAL OF PURE AND APPLIED ALGEBRA, 1982, 26 (02) : 115 - 139
  • [3] Quasi-polynomial tractability
    Gnewuch, Michael
    Wozniakowski, Henryk
    JOURNAL OF COMPLEXITY, 2011, 27 (3-4) : 312 - 330
  • [4] A Quasi-Polynomial Time Partition Oracle for Graphs with an Excluded Minor
    Levi, Reut
    Ron, Dana
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT I, 2013, 7965 : 709 - 720
  • [5] A tight quasi-polynomial bound for Global Label Min-Cut
    Jaffke, Lars
    Limat, Paloma T.
    Masarik, Tomas
    Pilipczuk, Marcin
    Souza, Ueverton S.
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 290 - 303
  • [6] Independent Set on Pk-Free Graphs in Quasi-Polynomial Time
    Gartland, Peter
    Lokshtanov, Daniel
    2020 IEEE 61ST ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2020), 2020, : 613 - 624
  • [7] Necessary conditions for the existence of quasi-polynomial invariants: the quasi-polynomial and Lotka-Volterra systems
    Figueiredo, A
    Rocha, TM
    Brenig, L
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 1999, 262 (1-2) : 158 - 180
  • [8] Composition of quasi-polynomial maps
    Niboucha, Razika
    Salinier, Alain
    JOURNAL DE THEORIE DES NOMBRES DE BORDEAUX, 2017, 29 (02): : 569 - 601
  • [9] Maximum Weight Independent Set in Graphs with no Long Claws in Quasi-Polynomial Time
    Gartland, Peter
    Lokshtanov, Daniel
    Masarik, Tomas
    Pilipczuk, Marcin
    Pilipczuk, Michal
    Rzazewski, Pawel
    PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 683 - 691
  • [10] Quasi-Polynomial Time Approximation Schemes for Packing and Covering Problems in Planar Graphs
    Pilipczuk, Michal
    van Leeuwen, Erik Jan
    Wiese, Andreas
    ALGORITHMICA, 2020, 82 (06) : 1703 - 1739
12345