scientific article; zbMATH DE number 7278006
From MaRDI portal
Publication:5136215
DOI10.4230/LIPIcs.ISAAC.2017.1zbMath1457.68302MaRDI QIDQ5136215
Publication date: 25 November 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An augmenting path algorithm for linear matroid parity
- Matching theory
- Matroid matching and some applications
- Über die Maximalzahl kreuzungsfreier H-Wege
- The linear delta-matroid parity problem
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Matroid matching via mixed skew-symmetric matrices
- Algebraic Algorithms for Linear Matroid Parity Problems
- Matroid Matching: The Power of Local Search
- Matroid Intersection
- A Fast, Simpler Algorithm for the Matroid Parity Problem
- Algebraic Algorithms for Matching and Matroid Problems
- Complexity of Matroid Property Algorithms
- Random pseudo-polynomial algorithms for exact matroid problems
- Matroid intersection algorithms
- AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
- A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
- Shortest Disjoint S-Paths Via Weighted Linear Matroid Parity
- On the Abstract Properties of Linear Dependence
- Computing the Degree of Determinants via Combinatorial Relaxation
- A weighted linear matroid parity algorithm
- Paths, Trees, and Flowers
- Steiner Tree Approximation via Iterative Randomized Rounding
- Maximum matching and a polyhedron with 0,1-vertices
- Minimum partition of a matroid into independent subsets
- Matroids and the greedy algorithm
This page was built for publication:
