Online network design with outliers

DOI10.1007/s00453-015-0021-yzbMath1348.68015OpenAlexW1156540784WikidataQ116754393 ScholiaQ116754393MaRDI QIDQ334928

Piotr Sankowski, Fabrizio Grandoni, Stefano Leonardi, Aris Anagnostopoulos

Publication date: 1 November 2016

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-015-0021-y

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Network design and communication in computer systems (68M10) Combinatorial optimization (90C27) Online algorithms; streaming algorithms (68W27)

Related Items

Unnamed Item

Cites Work

• Online algorithms. The state of the art
• Prophet-type inequalities for multi-choice optimal stopping
• The Dynamic and Stochastic Knapsack Problem
• Saving an epsilon
• Online Network Design with Outliers
• A Knapsack Secretary Problem with Applications
• The Secretary Problem and Its Extensions: A Review
• Dynamic Steiner Tree Problem
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Minimizing the expected rank with full information
• Beyond Competitive Analysis
• Markov Paging
• On-Line Paging Against Adversarially Biased Random Inputs
• Algorithms for Secretary Problems on Graphs and Hypergraphs
• Prophet Inequalities with Limited Information
• Approximation Algorithms for 2-Stage Stochastic Optimization Problems
• Dynamic Programming and Decision Theory
• A tight bound on approximating arbitrary metrics by tree metrics
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Online network design with outliers