Online network design with outliers (Q334928): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q116754393, #quickstatements; #temporary_batch_1709738850358
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.1007/s00453-015-0021-y / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1156540784 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online Network Design with Outliers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prophet Inequalities with Limited Information / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Knapsack Secretary Problem with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934624 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4223058 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the expected rank with full information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768359 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5653410 / 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: Online algorithms. The state of the art / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Secretary Problem and Its Extensions: A Review / rank
 
Normal rank
Property / cites work
 
Property / cites work: Saving an epsilon / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579386 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4012003 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Steiner Tree Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markov Paging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5517486 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Prophet-type inequalities for multi-choice optimal stopping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2921721 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Dynamic and Stochastic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Secretary Problems on Graphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond Competitive Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Decision Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4315289 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4010309 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Analysis of Several Heuristics for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for 2-Stage Stochastic Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-Line Paging Against Adversarially Biased Random Inputs / rank
 
Normal rank

Latest revision as of 21:13, 12 July 2024

scientific article
Language Label Description Also known as
English
Online network design with outliers
scientific article

    Statements

    Online network design with outliers (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 November 2016
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references