On the approximability of robust spanning tree problems (Q620950): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.006 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1523324024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation of min-max and min-max regret versions of some combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Min-max and min-max regret versions of combinatorial optimization problems: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845256 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free Bits, PCPs, and Nonapproximability---Towards Tight Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to Stochastic Programming / 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: On Two-Stage Stochastic Minimum Spanning Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-stage stochastic matching and spanning tree problems: polynomial instances and approximation / 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: On the random 2-stage minimum spanning tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the approximability of minmax (regret) network optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A randomized algorithm for the min-Max selecting items problem with uncertain weights / rank
 
Normal rank
Property / cites work
 
Property / cites work: Commitment under uncertainty: Two-stage stochastic matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust discrete optimization and its applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4845371 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Single Machine Scheduling with Scenarios / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hedging uncertainty: approximation algorithms for stochastic optimization problems / rank
 
Normal rank

Latest revision as of 17:57, 3 July 2024

scientific article
Language Label Description Also known as
English
On the approximability of robust spanning tree problems
scientific article

    Statements

    On the approximability of robust spanning tree problems (English)
    0 references
    0 references
    0 references
    2 February 2011
    0 references
    0 references
    combinatorial optimization
    0 references
    approximation
    0 references
    robust optimization
    0 references
    two-stage optimization
    0 references
    computational complexity
    0 references
    0 references