Integer Programming in Parameterized Complexity: Three Miniatures.
From MaRDI portal
Publication:5009484
DOI10.4230/LIPIcs.IPEC.2018.21OpenAlexW2808231908MaRDI QIDQ5009484
Tomáš Gavenčiak, Dušan Knop, Martin Koutecký
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1711.02032
Related Items (8)
13th International Symposium on Parameterized and Exact Computation (IPEC 2018) ⋮ Iterated Type Partitions ⋮ A general scheme for solving a large set of scheduling problems with rejection in FPT time ⋮ Parameterized complexity of immunization in the threshold model ⋮ Integer programming in parameterized complexity: five miniatures ⋮ Immunization in the threshold model: a parameterized complexity study ⋮ On improved interval cover mechanisms for crowdsourcing markets ⋮ Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Combinatorial optimization and applications. 10th international conference, COCOA 2016, Hong Kong, China, December 16--18, 2016. Proceedings
- Fundamentals of parameterized complexity
- Complexity of conflict-free colorings of graphs
- Scheduling and fixed-parameter tractability
- Finding the longest isometric cycle in a graph
- An application of simultaneous diophantine approximation in combinatorial optimization
- Geometric algorithms and combinatorial optimization.
- Computational complexity of distance edge labeling
- Algorithmic meta-theorems for restrictions of treewidth
- Integer convex minimization by mixed integer linear optimization
- A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\)
- \(n\)-fold integer programming in cubic time
- Integer optimization on convex semialgebraic sets
- Parameterized complexity of fair deletion problems
- Scheduling meets \(n\)-fold integer programming
- Complexity of integer quasiconvex polynomial optimization
- Parameterized complexity of distance labeling and uniform channel assignment problems
- Finiteness theorems in stochastic integer programming
- Algorithms and computation. 19th international symposium, ISAAC 2008, Gold Coast, Australia, December 15--17, 2008. Proceedings
- What’s Next? Future Directions in Parameterized Complexity
- Integer Programming with a Fixed Number of Variables
- Parametric Integer Programming in Fixed Dimension
- Elections with Few Candidates: Prices, Weights, and Covering Problems
- Capacitated Domination and Covering: A Parameterized Perspective
- An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths
- Minkowski's Convex Body Theorem and Integer Programming
- On the complexity of integer programming
- Approximation results for the optimum cost chromatic partition problem
- Faster Algorithms for Integer Programs with Block Structure
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- Near-optimal deterministic algorithms for volume computation via M-ellipsoids
- Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width
- Parameterized Resiliency Problems via Integer Linear Programming
- Mathematical Foundations of Computer Science 2004
- Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs
- The Graph Motif Problem Parameterized by the Structure of the Input Graph
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- Parameterized shifted combinatorial optimization
This page was built for publication: Integer Programming in Parameterized Complexity: Three Miniatures.
