Parameterized algorithms for matching integer programs with additional rows and columns
From MaRDI portal
Cites work
- \(n\)-fold integer programming in cubic time
- A polynomial-time algorithm for optimizing over N-fold 4-block decomposable integer programs
- A Separation Algorithm for b-Matching Degree-Sequence Polyhedra
- Backdoors to satisfaction
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Congruency-constrained TU problems beyond the bimodular case
- Convexity of degree sequences
- Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
- Empowering the configuration-IP: new PTAS results for scheduling with setup times
- Faster Algorithms for Integer Programs with Block Structure
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- Geometric algorithms and combinatorial optimization
- Graph Layout Problems Parameterized by Vertex Cover
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- scientific article; zbMATH DE number 7559382 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- scientific article; zbMATH DE number 2234775 (Why is no real title available?)
- Integer programming in parameterized complexity: five miniatures
- Integer Programming with a Fixed Number of Variables
- Integer programs with bounded subdeterminants and two nonzeros per row
- Integer programs with nearly totally unimodular matrices: the cographic case
- M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
- Matching is as easy as matrix inversion
- Matching, Euler tours and the Chinese postman
- Optimal general factor problem and jump system intersection
- Parameterized algorithms for block-structured integer programs with large entries
- Parameterized complexity of distance labeling and uniform channel assignment problems
- Polynomiality for Bin Packing with a Constant Number of Item Types
- Random pseudo-polynomial algorithms for exact matroid problems
- Sensitivity theorems in integer linear programming
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints
- The complexity of restricted spanning tree problems
- The factorization of graphs. II
- The perfectly matchable subgraph polytope of a bipartite graph
- The subspace flatness conjecture and faster integer programming
- Tight lower bounds for block-structured integer programs
- Voting schemes for which it can be difficult to tell who won the election
This page was built for publication: Parameterized algorithms for matching integer programs with additional rows and columns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7363200)
