Abstract
Given a graph G=(V,E) and a weight function on the edges w:E→ℝ, we consider the polyhedron P(G,w) of negative-weight flows on G, and get a complete characterization of the vertices and extreme directions of P(G,w). Based on this characterization, and using a construction developed in Khachiyan et al. (Discrete Comput. Geom. 39(1–3):174–190, 2008), we show that, unless P=NP, there is no output polynomial-time algorithm to generate all the vertices of a 0/1-polyhedron. This strengthens the NP-hardness result of Khachiyan et al. (Discrete Comput. Geom. 39(1–3):174–190, 2008) for non 0/1-polyhedra, and comes in contrast with the polynomiality of vertex enumeration for 0/1-polytopes (Bussiech and Lübbecke in Comput. Geom., Theory Appl. 11(2):103–109, 1998). As further applications, we show that it is NP-hard to check if a given integral polyhedron is 0/1, or if a given polyhedron is half-integral. Finally, we also show that it is NP-hard to approximate the maximum support of a vertex of a polyhedron in ℝn within a factor of 12/n.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abdullahi, S. D., Dyer, M. E., & Proll, L. G. (2003). Listing vertices of simple polyhedra associated with dual LI(2) systems. In DMTCS: discrete mathematics and theoretical computer science, 4th international conference, DMTCS 2003, proceedings (pp. 89–96).
Acuna, V., Chierichetti, F., Lacroix, V., Marchetti-Spaccamela, A., Sagot, M.-F., & Stougie, L. (2009). Modes and cuts in metabolic networks: complexity and algorithms. Biosystems, 95(1), 51–60.
Avis, D., & Fukuda, K. (1992). A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete and Computational Geometry, 8(3), 295–313.
Avis, D., & Fukuda, K. (1996). Reverse search for enumeration. Discrete Applied Mathematics, 65(1–3), 21–46.
Avis, D., Bremner, B., & Seidel, R. (1997). How good are convex hull algorithms. Computational Geometry: Theory and Applications, 7, 265–302.
Björklund, A., Husfeldt, T., & Khanna, S. (2004). Approximating longest directed paths and cycles. In Automata, languages and programming: 31st international colloquium, ICALP (pp. 222–233).
Boros, E., Elbassioni, K., Gurvich, V., & Makino, K. (2008). Generating vertices of polyhedra and related monotone generation problems. In Avis, D., Bremner, D., & Deza, A. (Eds.), Special issue on polyhedral computation : Vol. 48. CRM proceedings & lecture notes, centre de recherches mathématiques at the Université de Montréal (pp. 15–39). Providence: American Mathematical Society.
Bremner, D., Fukuda, K., & Marzetta, A. (1998). Primal-dual methods for vertex and facet enumeration. Discrete and Computational Geometry, 20, 333–357.
Bussieck, M. R., & Lübbecke, M. E. (1998). The vertex set of a 0/1 polytope is strongly ℘-enumerable. Computational Geometry: Theory and Applications, 11(2), 103–109.
Ding, G., Feng, L., & Zang, W. (2008). The complexity of recognizing linear systems with certain integrality properties. Math. Program., Ser. A, 114(2), 321–334.
Garg, N., & Vazirani, V. V. (1995). A polyhedron with all s-t cuts as vertices, and adjacency of cuts. Mathematical Programming, 70(1), 17–25.
Khachiyan, L., Boros, E., Borys, K., Elbassioni, K., & Gurvich, V. (2008). Generating all vertices of a polyhedron is hard. Discrete & Computational Geometry, 39(1–3), 174–190.
Lovász, L. (1992). Combinatorial optimization: some problems and trends (DIMACS Technical Report 92-53). Rutgers University.
Papadimitriou, C. H., & Yannakakis, M. (1990). On recognizing integer polyhedra. Combinatorica 10(1), 107–109.
Provan, J. S. (1994). Efficient enumeration of the vertices of polyhedra associated with network LP’s. Mathematical Programming, 63(1), 47–64.
Read, R. C., & Tarjan, R. E. (1975). Bounds on backtrack algorithms for listing cycles, paths, and spanning trees. Networks, 5, 237–252.
Schrijver, A. (1986). Theory of linear and integer programming. New York: Wiley.
Vazirani, V. V. (2001). Approximation algorithms. Berlin: Springer.
Author information
Authors and Affiliations
Corresponding author
Additional information
This research was partially supported by DIMACS, a collaborative project of Rutgers University, Princeton University, AT&T Labs-Research, Bell Labs, NEC Laboratories America and Telcordia Technologies, as well as affiliate members Avaya Labs, HP Labs, IBM Research, Microsoft Research, Stevens Institute of Technology, Georgia Institute of Technology and Rensselaer Polytechnic Institute. DIMACS was founded as an NSF Science and Technology Center.
Rights and permissions
About this article
Cite this article
Boros, E., Elbassioni, K., Gurvich, V. et al. The negative cycles polyhedron and hardness of checking some polyhedral properties. Ann Oper Res 188, 63–76 (2011). https://doi.org/10.1007/s10479-010-0690-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-010-0690-5