Dual-Bounded Generating Problems: All Minimal Integer Solutions for a Monotone System of Linear Inequalities

Authors:
E. Boros;K. Elbassioni;V. Gurvich;L. Khachiyan;K. Makino
Affiliations:
-;-;-;-;-
Venue:
SIAM Journal on Computing
Year:
2002

Citing 0
Cited 15

A global parallel algorithm for the hypergraph transversal problem

Information Processing Letters
An efficient implementation of a quasi-polynomial algorithm for generating hypergraph transversals and its application in joint generation

Discrete Applied Mathematics - Special issue: Discrete algorithms and optimization, in honor of professor Toshihide Ibaraki at his retirement from Kyoto University
Dual-bounded generating problems: Efficient and inefficient points for discrete probability distributions and sparse boxes for multidimensional data

Theoretical Computer Science
On the complexity of the multiplication method for monotone CNF/DNF dualization

ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On the dualization of hypergraphs with bounded edge-intersections and other related classes of hypergraphs

Theoretical Computer Science
A note on systems with max--min and max-product constraints

Fuzzy Sets and Systems
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions

Discrete Applied Mathematics
Computational aspects of monotone dualization: A brief survey

Discrete Applied Mathematics
On the complexity of monotone dualization and generating minimal hypergraph transversals

Discrete Applied Mathematics
Scientific contributions of Leo Khachiyan (a short overview)

Discrete Applied Mathematics
A Fast and Simple Parallel Algorithm for the Monotone Duality Problem

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
An intersection inequality for discrete distributions and related generation problems

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Left-to-Right Multiplication for Monotone Boolean Dualization

SIAM Journal on Computing
A new algorithm for the hypergraph transversal problem

COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Generating all minimal integral solutions to monotone ∧,∨-systems of linear, transversal and polymatroid inequalities

MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of enumerating all minimal integer solutions of a monotone system of linear inequalities. We first show that, for any monotone system of r linear inequalities in n variables, the number of maximal infeasible integer vectors is at most rn times the number of minimal integer solutions to the system. This bound is accurate up to a polylog(r) factor and leads to a polynomial-time reduction of the enumeration problem to a natural generalization of the well-known dualization problem for hypergraphs, in which dual pairs of hypergraphs are replaced by dual collections of integer vectors in a box. We provide a quasi-polynomial algorithm for the latter dualization problem. These results imply, in particular, that the problem of incrementally generating all minimal integer solutions to a monotone system of linear inequalities can be done in quasi-polynomial time.