Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty (Q2515038): Difference between revisions

From MaRDI portal
Added link to MaRDI 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/s10107-013-0742-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2063325434 / 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: Q3182207 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theory and Applications of Robust Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Tree Approximation via Iterative Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation, Randomization and Combinatorial Optimization. Algorithms and Techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-Terminal Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Combinatorial Optimization with Exponential Scenarios / 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: A new approach to the maximum-flow problem / 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: Boosted sampling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thresholded Covering Algorithms for Robust and Max-min Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4858094 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4309474 / 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: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3126752 / 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: Stochastic programming approach to optimization under uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lectures on Stochastic Programming / rank
 
Normal rank

Latest revision as of 17:06, 9 July 2024

scientific article
Language Label Description Also known as
English
Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty
scientific article

    Statements

    Improved approximations for two-stage MIN-cut and shortest path problems under uncertainty (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    9 February 2015
    0 references
    robust optimization
    0 references
    combinatorial optimization
    0 references
    approximation algorithms
    0 references

    Identifiers