Online network design with outliers

DOI10.1007/S00453-015-0021-YMaRDI QIDQ334928zbMATH OpenOpenAlexWikidataFDO

Authors Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Piotr Sankowski

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

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

Recommendations

• Online network design with outliers
• Online network design algorithms via hierarchical decompositions
• scientific article; zbMATH DE number 6469194
• A general approach to online network optimization problems
• Online constrained forest and prize-collecting network design

Cites work

• scientific article; zbMATH DE number 5764797 (Why is no real title available?)
• scientific article; zbMATH DE number 65698 (Why is no real title available?)
• scientific article; zbMATH DE number 67295 (Why is no real title available?)
• scientific article; zbMATH DE number 1232130 (Why is no real title available?)
• scientific article; zbMATH DE number 700091 (Why is no real title available?)
• scientific article; zbMATH DE number 1775400 (Why is no real title available?)
• scientific article; zbMATH DE number 3229274 (Why is no real title available?)
• scientific article; zbMATH DE number 3383344 (Why is no real title available?)
• A Knapsack Secretary Problem with Applications
• A multiple-choice secretary algorithm with applications to online auctions
• A tight bound on approximating arbitrary metrics by tree metrics
• Algorithms for Secretary Problems on Graphs and Hypergraphs
• Algorithms for facility location problems with outliers. (Extended abstract)
• An Analysis of Several Heuristics for the Traveling Salesman Problem
• Approximation Algorithms for 2-Stage Stochastic Optimization Problems
• Beyond Competitive Analysis
• Dynamic Programming and Decision Theory
• Dynamic Steiner Tree Problem
• Markov Paging
• Matroids, secretary problems, and online mechanisms
• Minimizing the expected rank with full information
• On-Line Paging Against Adversarially Biased Random Inputs
• Online algorithms. The state of the art
• Online network design with outliers
• Prophet Inequalities with Limited Information
• Prophet-type inequalities for multi-choice optimal stopping
• Saving an epsilon: a 2-approximation for the \(k\)-MST problem in graphs
• The Secretary Problem and Its Extensions: A Review
• The dynamic and stochastic knapsack problem

Cited in

(3)

• Online Buy-at-Bulk Network Design
• Online facility location with deletions
• Online network design with outliers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q334928)