Computing the optimal probability interval for the union of events is NP-hard.
Geometric algorithms and combinatorial optimization , SERIES =
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
citation-role summary
background 2
citation-polarity summary
roles
background 2polarities
background 2representative citing papers
O(log k)-approx for Cap-k-ECSS and constant 7-approx for (1,q)-FGC via knapsack-cover inequalities plus small-cuts covering.
The reverse polar of visible points from an infeasible point coincides with that of the full feasible region, enabling tighter valid cuts for MINLPs described by a single non-convex constraint intersected with a convex set.
Proves if-and-only-if equivalences for toric ring normality and quadratic toric ideal generation between anti-blocking lattice polytopes and their unconditional reflections, plus a graph-theoretic characterization of quadratic symmetric stable set ideals.
Gorenstein simplices with the given h*-polynomial are classified up to unimodular equivalence by strict divisor chains in the divisor lattice of v, yielding an explicit counting formula.
citing papers explorer
-
Optimal Union Probability Interval Is NP-Hard
Computing the optimal probability interval for the union of events is NP-hard.
-
Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
O(log k)-approx for Cap-k-ECSS and constant 7-approx for (1,q)-FGC via knapsack-cover inequalities plus small-cuts covering.
-
Visible points, the separation problem, and applications to MINLP
The reverse polar of visible points from an infeasible point coincides with that of the full feasible region, enabling tighter valid cuts for MINLPs described by a single non-convex constraint intersected with a convex set.
-
Algebraic aspects of unconditional lattice polytopes
Proves if-and-only-if equivalences for toric ring normality and quadratic toric ideal generation between anti-blocking lattice polytopes and their unconditional reflections, plus a graph-theoretic characterization of quadratic symmetric stable set ideals.
-
Classification and counting of Gorenstein simplices with $h^*$-polynomial $1+t^k+\cdots+t^{(v-1)k}$
Gorenstein simplices with the given h*-polynomial are classified up to unimodular equivalence by strict divisor chains in the divisor lattice of v, yielding an explicit counting formula.