Violator spaces vs closure spaces
From MaRDI portal
Publication:2311366
Abstract: Violator Spaces were introduced by J. Matousek et al. in 2008 as generalization of Linear Programming problems. Convex geometries were invented by Edelman and Jamison in 1985 as proper combinatorial abstractions of convexity. Convex geometries are defined by anti-exchange closure operators. We investigate an interrelations between violator spaces and closure spaces and show that violator mapping may be defined by a week version of closure operators. Moreover, we prove that violator spaces with an unique basis satisfies the anti-exchange and the Krein-Milman properties.
Recommendations
Cites work
- scientific article; zbMATH DE number 5899260 (Why is no real title available?)
- A combinatorial bound for linear programming and related problems
- A subexponential bound for linear programming
- Clarkson's algorithm for violator spaces
- Closure lattices
- Closure systems and their structure
- Greedoids
- Milman's Theorem for Convex Functions.
- The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
- The theory of convex geometries
- Violator spaces: Structure and algorithms
Cited in
(5)
This page was built for publication: Violator spaces vs closure spaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2311366)
