FPT-algorithm for computing the width of a simplex given by a convex hull
From MaRDI portal
Publication:2314204
DOI10.3103/S0278641919010084zbMath1418.90200MaRDI QIDQ2314204
Publication date: 19 July 2019
Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)
Related Items
On lattice point counting in \(\varDelta\)-modular polyhedra ⋮ Enumeration and unimodular equivalence of empty delta-modular simplices ⋮ On \(\Delta\)-modular integer linear problems in the canonical form and equivalent problems
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A dichotomy for the dominating set problem for classes defined by small forbidden induced subgraphs
- The width and integer optimization on simplices with bounded minors of the constraint matrices
- A complexity dichotomy and a new boundary class for the dominating set problem
- Critical hereditary graph classes: a survey
- A new polynomial-time algorithm for linear programming
- Integer program with bimodular matrix
- The computational complexity of dominating set problems for instances with bounded minors of constraint matrices
- FPT-algorithms for some problems related to integer programming
- A note on non-degenerate integer programs with small sub-determinants
- A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)
- The clique problem for graphs with a few eigenvalues of the same sign
- The computational complexity of three graph problems for instances with bounded minors of constraint matrices
- Complexity of integer quasiconvex polynomial optimization
- Some polyhedra related to combinatorial problems
- Combinatorial optimization. Theory and applications.
- A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming
- Integer Programming with a Fixed Number of Variables
- Polynomial algorithms in linear programming
- Lectures on Polytopes
- A strongly polynomial algorithm for bimodular integer linear programming
- Classes of graphs critical for the edge list-ranking problem
- Critical elements in combinatorially closed families of graph classes
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS
- Parameterized Algorithms
- FACES OF AN INTEGER POLYHEDRON
- Algorithms - ESA 2003
This page was built for publication: FPT-algorithm for computing the width of a simplex given by a convex hull
