Violator spaces vs closure spaces
From MaRDI portal
Publication:2311366
DOI10.1016/J.EJC.2018.07.012zbMATH Open1437.90099arXiv1607.02785OpenAlexW2963514383WikidataQ129370814 ScholiaQ129370814MaRDI QIDQ2311366FDOQ2311366
Authors: Yulia Kempner, Vadim E. Levit 
Publication date: 10 July 2019
Published in: European Journal of Combinatorics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1607.02785
Recommendations
Cites Work
- The theory of convex geometries
- A subexponential bound for linear programming
- A combinatorial bound for linear programming and related problems
- Violator spaces: Structure and algorithms
- Closure systems and their structure
- Greedoids
- The duality between the anti-exchange closure operators and the path independent choice operators on a finite set
- Title not available (Why is that?)
- Clarkson's algorithm for violator spaces
- Closure lattices
- Milman's Theorem for Convex Functions.
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)
