Integer programming in parameterized complexity: five miniatures (Q2673236): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: AIMMS / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disopt.2020.100596 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3044145206 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming in Parameterized Complexity: Three Miniatures. / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of simultaneous diophantine approximation in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minkowski's Convex Body Theorem and Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming with a Fixed Number of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Foundations of Computer Science 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Layout Problems Parameterized by Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic meta-theorems for restrictions of treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Two Competing Agents When One Agent Has Significantly Fewer Jobs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An OPT + 1 Algorithm for the Cutting Stock Problem with Constant Number of Object Lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling meets \(n\)-fold integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling and fixed-parameter tractability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Elections with Few Candidates: Prices, Weights, and Covering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(n\)-fold integer programming in cubic time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4608073 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4636646 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized shifted combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Modular-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: What’s Next? Future Directions in Parameterized Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Game Theoretic Approach for Efficient Graph Coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (Parameterized) Complexity of Recognizing Well-Covered $$(r,\ell )$$ -graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of conflict-free colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of fair deletion problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Capacitated Domination and Covering: A Parameterized Perspective / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation results for the optimum cost chromatic partition problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost Optimal Lower Bounds for Problems Parameterized by Clique-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of vertex colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607896 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal deterministic algorithms for volume computation via M-ellipsoids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer optimization on convex semialgebraic sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of integer quasiconvex polynomial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new Lenstra-type algorithm for quasiconvex polynomial integer minimization with complexity \(2^{O(n\log n)}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerative Lattice Algorithms in any Norm Via M-ellipsoid Coverings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer convex minimization by mixed integer linear optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Integer Programming in Fixed Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Resiliency Problems via Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight Complexity Lower Bounds for Integer Linear Programming with Few Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4607934 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5140719 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster Algorithms for Integer Programs with Block Structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2762573 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finiteness theorems in stochastic integer programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: About the Complexity of Two-Stage Stochastic IPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904855 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subdeterminants and Concave Integer Quadratic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On integer points in polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Subset Feedback Vertex Set Is Fixed-Parameter Tractable / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPTAS for optimizing polynomials over the mixed-integer points of polytopes in fixed dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: An FPTAS for Minimizing Indefinite Quadratic Forms over Integers in Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: A strongly polynomial algorithm for bimodular integer linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Structural Approach to Kernels for ILPs: Treewidth and Total Unimodularity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonlinear discrete optimization. An algorithmic theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming and incidence treedepth / rank
 
Normal rank
Property / cites work
 
Property / cites work: The quadratic Graver cone, quadratic integer minimization, and extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints / rank
 
Normal rank

Latest revision as of 07:13, 29 July 2024

scientific article
Language Label Description Also known as
English
Integer programming in parameterized complexity: five miniatures
scientific article

    Statements

    Integer programming in parameterized complexity: five miniatures (English)
    0 references
    0 references
    0 references
    0 references
    9 June 2022
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    graph coloring
    0 references
    sum-coloring
    0 references
    parameterized complexity
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references