Bisubmodular Function Minimization
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
The linear delta-matroid parity problem
Journal of Combinatorial Theory Series B
Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability
Discrete Applied Mathematics - Submodularity
Polynomials with the half-plane property and the support theorems
Journal of Combinatorial Theory Series B
Induction of M-convex functions by linking systems
Discrete Applied Mathematics
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Even factors, jump systems, and discrete convexity
Journal of Combinatorial Theory Series B
A greedy buffer allocation algorithm for power-aware communication in body sensor networks
CODES/ISSS '10 Proceedings of the eighth IEEE/ACM/IFIP international conference on Hardware/software codesign and system synthesis
Discrete Concavity and the Half-Plane Property
SIAM Journal on Discrete Mathematics
Submodularity on a tree: unifying L-convex and bisubmodular functions
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Neighbor Systems and the Greedy Algorithm
SIAM Journal on Discrete Mathematics
Generalized roof duality and bisubmodular functions
Discrete Applied Mathematics
Algebraic algorithms for linear matroid parity problems
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Approximability of bounded occurrence max ones
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach
Journal of Combinatorial Theory Series B
A proof of Cunningham's conjecture on restricted subgraphs and jump systems
Journal of Combinatorial Theory Series B
A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs
Discrete Optimization
Neighbor Systems, Jump Systems, and Bisubmodular Polyhedra
SIAM Journal on Discrete Mathematics
Towards minimizing k-submodular functions
ISCO'12 Proceedings of the Second international conference on Combinatorial Optimization
Matching problems with delta-matroid constraints
CATS '12 Proceedings of the Eighteenth Computing: The Australasian Theory Symposium - Volume 128
| Hi-index | 0.00 |
This paper relates an axiomatic generalization of matroids, called a jump system, to polyhedra arising from bisubmodular functions. Unlike the case for usual submodularity, the points of interest are not all the integral points in the relevant polyhedron but form a subset of them. However, it is shown that the convex hull of the set of points of a jump system is a bisubmodular polyhedron, and that the integral points of an integral bisubmodular polyhedron determine a (special) jump system. The authors prove addition and composition theorems for jump systems, which have several applications for delta-matroids and matroids.