The complexity of optimization on grids (Q2319631): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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.1007/s00453-019-00587-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2947440460 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric applications of a matrix-searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Algorithms for Unique Sink Orientations of Grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oriented Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Deterministic Algorithms for Linear Programming in Low Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Grid orientations, \((d,d+2)\)-polytopes, and arrangements of pseudolines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming with convexity, concavity and sparsity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Violator spaces: Structure and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unique sink orientations of grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: One line and n points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for configurations and polytopes in \({\mathbb{R}}^ d\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5531623 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for Random-Edge and Random-Jump on abstract cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential bound for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Random edge can be exponential on abstract cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418650 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding the sink takes some time: An almost quadratic lower bound for finding the sink of unique sink oriented cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jumping Doesn’t Help in Abstract Cubes / rank
 
Normal rank

Latest revision as of 06:14, 20 July 2024

scientific article
Language Label Description Also known as
English
The complexity of optimization on grids
scientific article

    Statements

    The complexity of optimization on grids (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    20 August 2019
    0 references
    unique-sink orientation
    0 references
    optimization
    0 references
    linear programming
    0 references

    Identifiers