Integer programming in parameterized complexity: three miniatures
From MaRDI portal
(Redirected from Publication:5009484)
Recommendations
- Integer programming in parameterized complexity: five miniatures
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- Combinatorial \(n\)-fold integer programming and applications
- Combinatorial \(n\)-fold integer programming and applications
- Sparse integer programming is FPT
Cites work
- \(n\)-fold integer programming in cubic time
- A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- Algorithmic meta-theorems for restrictions of treewidth
- Algorithms and computation. 19th international symposium, ISAAC 2008, Gold Coast, Australia, December 15--17, 2008. Proceedings
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
- An application of simultaneous diophantine approximation in combinatorial optimization
- An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths
- Approximation results for the optimum cost chromatic partition problem
- Capacitated Domination and Covering: A Parameterized Perspective
- Combinatorial \(n\)-fold integer programming and applications
- Combinatorial optimization and applications. 10th international conference, COCOA 2016, Hong Kong, China, December 16--18, 2016. Proceedings
- Complexity of conflict-free colorings of graphs
- Complexity of integer quasiconvex polynomial optimization
- Covering a tree with rooted subtrees -- parameterized and approximation algorithms
- Elections with few candidates: prices, weights, and covering problems
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- Evaluating and tuning n-fold integer programming
- Faster Algorithms for Integer Programs with Block Structure
- Finding the longest isometric cycle in a graph
- Finiteness theorems in stochastic integer programming
- Fundamentals of parameterized complexity
- Geometric algorithms and combinatorial optimization.
- scientific article; zbMATH DE number 1688600 (Why is no real title available?)
- scientific article; zbMATH DE number 6850361 (Why is no real title available?)
- Integer convex minimization by mixed integer linear optimization
- Integer optimization on convex semialgebraic sets
- Integer Programming with a Fixed Number of Variables
- Mathematical Foundations of Computer Science 2004
- Minkowski's Convex Body Theorem and Integer Programming
- Near-optimal deterministic algorithms for volume computation via M-ellipsoids
- On the complexity of integer programming
- Parameterized complexity of distance labeling and uniform channel assignment problems
- Parameterized resiliency problems via integer linear programming
- Parametric integer programming in fixed dimension
- Scheduling and fixed-parameter tractability
- Scheduling meets n-fold integer programming
- Scheduling two competing agents when one agent has significantly fewer jobs
- The graph motif problem parameterized by the structure of the input graph
- Voting and bribing in single-exponential time
- What's next? Future directions in parameterized complexity
Cited in
(15)- A general scheme for solving a large set of scheduling problems with rejection in FPT time
- Parameterized complexity of immunization in the threshold model
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
- Parameterized complexity of configuration integer programs
- Integer programming in parameterized complexity: five miniatures
- 13th International Symposium on Parameterized and Exact Computation (IPEC 2018)
- Iterated Type Partitions
- Parameterized and Exact Computation
- The Complexity of Three-Element Min-Sol and Conservative Min-Cost-Hom
- Integer programming approaches for minimum stabbing problems
- Immunization in the threshold model: a parameterized complexity study
- On improved interval cover mechanisms for crowdsourcing markets
- Speeding up networks mining via neighborhood diversity
- How to tamper with a parliament: strategic campaigns in apportionment elections
- Scheduling kernels via configuration LP
This page was built for publication: Integer programming in parameterized complexity: three miniatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5009484)
