Online network design with outliers (Q334928)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

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

Statements

scholarly article

Online network design with outliers (English)

Aris Anagnostopoulos

Fabrizio Grandoni

Stefano Leonardi

Piotr Sankowski

publication date

1 November 2016

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1007/s00453-015-0021-y

Online Network Design with Outliers

Prophet Inequalities with Limited Information

A Knapsack Secretary Problem with Applications

Minimizing the expected rank with full information

A tight bound on approximating arbitrary metrics by tree metrics

Online algorithms. The state of the art

The Secretary Problem and Its Extensions: A Review

Saving an epsilon

Dynamic Steiner Tree Problem

Prophet-type inequalities for multi-choice optimal stopping

The Dynamic and Stochastic Knapsack Problem

Algorithms for Secretary Problems on Graphs and Hypergraphs

Beyond Competitive Analysis

Dynamic Programming and Decision Theory

An Analysis of Several Heuristics for the Traveling Salesman Problem

Approximation Algorithms for 2-Stage Stochastic Optimization Problems

On-Line Paging Against Adversarially Biased Random Inputs

Identifiers

Sitelinks

Mathematics(1 entry)

mardi Publication:334928

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q334928&oldid=38309193"