Thresholded covering algorithms for robust and max-min optimization (Q403674): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Price of Correlations in Stochastic Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general approach to online network optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online Set Cover Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Convex Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527000 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tractable approximations to robust conic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved LP-based approximation for steiner tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing a Monotone Submodular Function Subject to a Matroid Constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized metarounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The all-or-nothing multicommodity flow problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multicommodity flow, well-linked terminals, and routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tight bound on approximating arbitrary metrics by tree metrics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Combinatorial Optimization with Exponential Scenarios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4196269 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for partial covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving an epsilon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the <i>k</i>-multicut problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dial a Ride from <i>k</i> -forest / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sampling and Cost-Sharing: Approximation Algorithms for Stochastic Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-stage robust network design with exponential scenarios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An analysis of approximations for maximizing submodular set functions—I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic construction of deterministic algorithms: approximating packing integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hedging uncertainty: approximation algorithms for stochastic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation scheme for stochastic linear programming and its application to stochastic integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved performance of the greedy algorithm for partial cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on maximizing a submodular set function subject to a knapsack constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5365144 / rank
 
Normal rank

Latest revision as of 22:54, 8 July 2024

scientific article
Language Label Description Also known as
English
Thresholded covering algorithms for robust and max-min optimization
scientific article

    Statements

    Thresholded covering algorithms for robust and max-min optimization (English)
    0 references
    0 references
    0 references
    0 references
    29 August 2014
    0 references
    two-stage robust covering problem
    0 references
    \(k\)-robust model
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references