Greedy algorithm and symmetric matroids
From MaRDI portal
Publication:3772000
DOI10.1007/BF02604639zbMath0633.90089OpenAlexW1984509778MaRDI QIDQ3772000
Publication date: 1987
Published in: Mathematical Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02604639
Programming involving graphs or networks (90C35) Combinatorial aspects of matroids and geometric lattices (05B35)
Related Items (only showing first 100 items - show all)
Characterizations of the set of integer points in an integral bisubmodular polyhedron ⋮ Delta-matroids whose twist polynomials are monomials ⋮ Signed permutohedra, delta‐matroids, and beyond ⋮ A framework for the greedy algorithm ⋮ A characterization of circle graphs in terms of total unimodularity ⋮ Isotropic matroids. III: Connectivity ⋮ Universal Tutte characters via combinatorial coalgebras ⋮ Discrete Decision Process Model Involves Greedy Algorithm over Greedoid ⋮ Maurer's homotopy theory for even \(\Delta\)-matroids and related combinatorial geometries ⋮ Handle slides for delta-matroids ⋮ Maps and \(\Delta\)-matroids ⋮ Unimodularity and circle graphs ⋮ Circuit separation for symmetric matroids ⋮ Pfaffian forms and \(\Delta\)-matroids with coefficients ⋮ A characterization of bisubmodular functions ⋮ Basis graphs of even delta-matroids ⋮ A generalization of Tutte's characterization of totally unimodular matrices ⋮ The class of delta-matroids closed under handle slides ⋮ Note on exchange axioms for valuated matroids and valuated delta-matroids ⋮ Rank-width: algorithmic and structural results ⋮ A polyhedral approach to bisubmodular function minimization ⋮ The delta-sum of matching delta-matroids ⋮ Nonintersecting paths, Pfaffians, and \(\Delta\)-matroids ⋮ Twist polynomials of delta-matroids ⋮ Sorting by reversals and the theory of 4-regular graphs ⋮ How many delta-matroids are there? ⋮ Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs ⋮ Coverings and delta-coverings ⋮ From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals ⋮ Interlacement and activities in delta-matroids ⋮ The structure of delta-matroids with width one twists ⋮ Generalized roof duality and bisubmodular functions ⋮ The linear delta-matroid parity problem ⋮ Unified Greedy Approximability beyond Submodular Maximization ⋮ Flag matroids with coefficients ⋮ Initial degenerations of spinor varieties ⋮ Amalgamation of real zero polynomials ⋮ Blowup polynomials and delta-matroids of graphs ⋮ Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices ⋮ Unified greedy approximability beyond submodular maximization ⋮ Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids ⋮ Partial-twuality polynomials of delta-matroids ⋮ First-order logic axiomatization of metric graph theory ⋮ A proof of Cunningham's conjecture on restricted subgraphs and jump systems ⋮ Well-quasi-ordering of matrices under Schur complement and applications to directed graphs ⋮ Isotropical linear spaces and valuated Delta-matroids ⋮ Matroids that classify forests ⋮ Matchings and \(\Delta\)-matroids ⋮ A note on M-convex functions on jump systems ⋮ Bipolarization of posets and natural interpolation ⋮ The Orthant Non-Interaction Theorem for Certain Combinatorial Polyhedra and its Implications in the Intersection and the Dilworth Truncation of Bisubmodular Functions ⋮ Representability of \(\bigtriangleup\)-matroids over \(GF(2)\) ⋮ On pseudomatroid property of matrices ⋮ The salesman's improved tours for fundamental classes ⋮ Binary matroids and local complementation ⋮ Polynomials with the half-plane property and matroid theory ⋮ \(b\)-matching degree-sequence polyhedra ⋮ Tutte-Martin polynomials and orienting vectors of isotropic systems ⋮ Delta matroids whose fundamental graphs are bipartite ⋮ The transition matroid of a 4-regular graph: an introduction ⋮ Maps and Δ-matroids revisited ⋮ \(\Delta\)-matroids and metroids ⋮ Optimal Matching Forests and Valuated Delta-Matroids ⋮ A greedy-algorithm characterization of valuated \(\Delta\)-matroids ⋮ Cuboids, a class of clutters ⋮ Orienting transversals and transition polynomials of multimatroids ⋮ Orthogonal matroids ⋮ Oriented Lagrangian orthogonal matroid representations ⋮ Multimatroids. III: Tightness and fundamental graphs ⋮ The excluded 3-minors for vf-safe delta-matroids ⋮ Delta-matroids as subsystems of sequences of Higgs lifts ⋮ A 2-isomorphism theorem for delta-matroids ⋮ Polynomial combinatorial algorithms for skew-bisubmodular function minimization ⋮ Excluding a bipartite circle graph from line graphs ⋮ Submodular function minimization ⋮ Matroidal frameworks for topological Tutte polynomials ⋮ Lagrangian subspaces, delta-matroids, and four-term relations ⋮ Pfaffian forms and \(\Delta\)-matroids ⋮ Even factors, jump systems, and discrete convexity ⋮ A disturbed version of the greedy algorithm ⋮ A circuit axiomatisation of Lagrangian matroids ⋮ Circle graph obstructions under pivoting ⋮ On structures of bisubmodular polyhedra ⋮ Symplectic matroids ⋮ Characterizing matroids whose bases form graphic delta-matroids ⋮ Matroids, delta-matroids and embedded graphs ⋮ The Tutte polynomial via lattice point counting ⋮ The greedy algorithm and Coxeter matroids ⋮ \(k\)-best solutions under distance constraints in valuated \(\Delta\)-matroids ⋮ A unified treatment of the geometric algebra of matroids and even \(\Delta\)-matroids ⋮ Coxeter matroid polytopes ⋮ Eulerian and bipartite binary delta-matroids ⋮ Combinatorial flag varieties ⋮ An adjacency criterion for Coxeter matroids ⋮ Graph polynomials derived from Tutte-Martin polynomials ⋮ Generalized skew bisubmodularity: a characterization and a min-max theorem ⋮ Bisubmodular polyhedra, simplicial divisions, and discrete convexity ⋮ Multimatroids. IV: Chain-group representations ⋮ \(\Delta\)-matroids with the strong exchange conditions ⋮ Irreducibility of the Tutte polynomial of an embedded graph
Cites Work
This page was built for publication: Greedy algorithm and symmetric matroids
