Total matching and subdeterminants

DOI10.1007/978-3-031-60924-4_15MaRDI QIDQ7030723zbMATH OpenFDO

Authors Luca Ferrarini, Samuel Fiorini, Stefan Kober, Yelena Yuditsky

Publication date 7 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-60924-4_15

zbMATH Keywords

FPT algorithmmaximum weight set of vertices and edges

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Extremal problems in graph theory (05C35) Integer programming (90C10)

Cites work

• A note on non-degenerate integer programs with small sub-determinants
• A strongly polynomial algorithm for bimodular integer linear programming
• Advances on strictly \(\varDelta \)-modular IPs
• Congruency-constrained TU problems beyond the bimodular case
• Integer programs with bounded subdeterminants and two nonzeros per row
• Notes on \(\{a,b,c\}\)-modular matrices
• Odd cycle packing
• On integer programming with bounded determinants
• On the algorithmic complexity of twelve covering and independence parameters of graphs
• Submodular minimization under congruency constraints
• Total coloring and total matching: polyhedra and facets
• Total matchings and total coverings of graphs

Cited in

(1)

• Totally -modular IPs with two non-zeros in most rows

This page was built for publication: Total matching and subdeterminants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7030723)