Allocating Bandwidth for Bursty Connections
From MaRDI portal
Publication:4507345
DOI10.1137/S0097539797329142zbMath0979.05098OpenAlexW2044081853MaRDI QIDQ4507345
Éva Tardos, Yuval Rabani, Jon M. Kleinberg
Publication date: 18 October 2000
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/s0097539797329142
combinatorial optimizationapproximation algorithmsstochastic knapsackstatistical multiplexingeffective bandwidthstochastic load balancingstochastic bin-packing
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Stochastic Makespan Minimization in Structured Set Systems (Extended Abstract) ⋮ Approximation algorithms for stochastic combinatorial optimization problems ⋮ Robust optimization approach for a chance-constrained binary knapsack problem ⋮ The structure and complexity of Nash equilibria for a selfish routing game ⋮ Extremal Probability Bounds in Combinatorial Optimization ⋮ An introduction to stochastic bin packing-based server consolidation with conflicts ⋮ Column generation strategies and decomposition approaches for the two-stage stochastic multiple knapsack problem ⋮ Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning ⋮ Stochastic models for budget optimization in search-based advertising ⋮ Mathematical models and approximate solution approaches for the stochastic bin packing problem ⋮ Approximation algorithms for multiprocessor scheduling under uncertainty ⋮ Configuration balancing for stochastic requests ⋮ Temporal flows in temporal networks ⋮ Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms ⋮ Lifting of probabilistic cover inequalities ⋮ Range-max queries on uncertain data ⋮ Relaxation Analysis for the Dynamic Knapsack Problem with Stochastic Item Sizes ⋮ A column and constraint generation algorithm for the dynamic knapsack problem with stochastic item sizes ⋮ Hedging uncertainty: approximation algorithms for stochastic optimization problems ⋮ The static stochastic knapsack problem with normally distributed item sizes ⋮ Unnamed Item ⋮ An improved mechanism for selfish bin packing ⋮ Robustness to Dependency in Portfolio Optimization Using Overlapping Marginals ⋮ The multi-Handler knapsack problem under uncertainty ⋮ Maximum box problem on stochastic points ⋮ Robust optimization-based heuristic algorithm for the chance-constrained knapsack problem using submodularity ⋮ Improvements and Generalizations of Stochastic Knapsack and Markovian Bandits Approximation Algorithms ⋮ Maximizing Expected Utility for Stochastic Combinatorial Optimization Problems ⋮ Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes ⋮ Stochastic Load Balancing on Unrelated Machines ⋮ Worst-Case Expected Shortfall with Univariate and Bivariate Marginals ⋮ Adaptive Bin Packing with Overflow ⋮ Stochastic makespan minimization in structured set systems
