scientific article; zbMATH DE number 7205032
From MaRDI portal
Publication:5111743
DOI10.4230/LIPIcs.ESA.2017.54zbMath1442.90129MaRDI QIDQ5111743
Martin Koutecký, Matthias Mnich, Dušan Knop
Publication date: 27 May 2020
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms (68W40) Integer programming (90C10) Combinatorial optimization (90C27) Parameterized complexity, tractability and kernelization (68Q27)
Related Items (19)
About the Complexity of Two-Stage Stochastic IPs ⋮ A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs ⋮ The Support of Integer Optimal Solutions ⋮ The last dozen of years of or research in Czechia and Slovakia ⋮ Combinatorial \(n\)-fold integer programming and applications ⋮ Near-Linear Time Algorithm for $n$-Fold ILPs via Color Coding ⋮ Faster Algorithms for Integer Programs with Block Structure ⋮ Integer Programming in Parameterized Complexity: Three Miniatures. ⋮ Unnamed Item ⋮ Parameterized complexity of machine scheduling: 15 open problems ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ The clever shopper problem ⋮ Parameterized complexity of a coupled-task scheduling problem ⋮ Unnamed Item ⋮ Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting ⋮ Unnamed Item ⋮ About the complexity of two-stage stochastic IPs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On polynomial kernels for sparse integer linear programs
- Parameterized complexity analysis for the closest string with wildcards problem
- A polynomial oracle-time algorithm for convex integer minimization
- On covering problems of codes
- Efficient algorithms for consensus string problems minimizing both distance sum and radius
- Scheduling and fixed-parameter tractability
- Nonlinear discrete optimization. An algorithmic theory
- Fixed-parameter algorithms for CLOSEST STRING and related problems
- The complexity landscape of decompositional parameters for ILP
- Multivariate complexity analysis of Swap Bribery
- Algorithmic meta-theorems for restrictions of treewidth
- \(n\)-fold integer programming in cubic time
- Integer optimization on convex semialgebraic sets
- Graver basis and proximity techniques for block-structured separable convex integer minimization problems
- Scheduling meets \(n\)-fold integer programming
- Huge multiway table problems
- Parameterized complexity of distance labeling and uniform channel assignment problems
- Parameterized Algorithms for Modular-Width
- Integer Programming with a Fixed Number of Variables
- Elections with Few Candidates: Prices, Weights, and Covering Problems
- A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity
- Graph Layout Problems Parameterized by Vertex Cover
- Minkowski's Convex Body Theorem and Integer Programming
- Mathematical Foundations of Computer Science 2004
- Polynomiality for Bin Packing with a Constant Number of Item Types
- Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings
- Parameterized Algorithms
This page was built for publication:
