Counting Vertices of Integral Polytopes Defined by Facets-Reference-Cited by-同舟云学术

Counting Vertices of Integral Polytopes Defined by Facets

Published:2022-07-05 Issue: Volume: Page:
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Guo Heng,Jerrum Mark^ORCID

Abstract

AbstractWe present a number of complexity results concerning the problem of counting vertices of an integral polytope defined by a system of linear inequalities. The focus is on polytopes with small integer vertices, particularly 0/1 polytopes and half-integral polytopes.

Funder

h2020 european research council

engineering and physical sciences research council

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

https://link.springer.com/content/pdf/10.1007/s00454-022-00406-8.pdf

Reference24 articles.

1. Anari, N., Liu, K., Gharan, S.O., Vinzant, C.: Log-concave polynomials II: High-dimensional walks and an FPRAS for counting bases of a matroid. In: 51st Annual ACM SIGACT Symposium on Theory of Computing (Phoenix 2019), pp. 1–12. ACM, New York (2019)

2. Avis, D., Devroye, L.: Estimating the number of vertices of a polyhedron. Inf. Process. Lett. 73(3–4), 137–143 (2000)

3. Balinski, M.L.: Integer programming: methods, uses, computation. Manage. Sci. 12, 253–313 (1965)

4. Chebolu, P., Goldberg, L.A., Martin, R.: The complexity of approximately counting stable matchings. Theoret. Comput. Sci. 437, 35–68 (2012)

5. Chen, X., Dyer, M., Goldberg, L.A., Jerrum, M., Lu, P., McQuillan, C., Richerby, D.: The complexity of approximating conservative counting CSPs. J. Comput. System Sci. 81(1), 311–329 (2015)