scientific article; zbMATH DE number 6850486

zbMath1403.68343MaRDI QIDQ4608073

Lin Chen, Dániel Marx

Publication date: 15 March 2018

Full work available at URL: http://dl.acm.org/citation.cfm?id=3175482

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

integer programmingschedulingapproximation schemesfixed-parameter tractable

Mathematics Subject Classification ID

Integer programming (90C10) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (13)

A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs ⋮ Integer programming in parameterized complexity: five miniatures ⋮ High-multiplicity \(N\)-fold IP via configuration LP ⋮ Block-structured integer programming: can we parameterize without the largest coefficient? ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Faster Algorithms for Integer Programs with Block Structure ⋮ Integer Programming in Parameterized Complexity: Three Miniatures. ⋮ The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints ⋮ Unnamed Item ⋮ Subset Selection in Sparse Matrices ⋮ Unnamed Item ⋮ Matrices of Optimal Tree-Depth and a Row-Invariant Parameterized Algorithm for Integer Programming

This page was built for publication: