scientific article; zbMATH DE number 7525482
From MaRDI portal
Publication:5075788
DOI10.4230/LIPIcs.ESA.2019.45MaRDI QIDQ5075788
Yangguang Shi, Ron Lavi, Shay Kutten, Yuval Emek
Publication date: 11 May 2022
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
approximation algorithmsenergy consumptiongeneralized network designdiseconomies of scaleBayesian competitive ratioBayesian ignorancesmoothness, best response dynamics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on two problems in connexion with graphs
- Bayesian ignorance
- Randomized oblivious integral routing for minimizing power cost
- Progressive hedging-based metaheuristics for stochastic network design
- Intrinsic Robustness of the Price of Anarchy
- Set connectivity problems in undirected graphs and the directed steiner network problem
- Probability inequalities of the Tchebycheff type
- Speed scaling to manage energy and temperature
- Algorithms for Energy Management
- Survey on Oblivious Routing Strategies
- Oblivious network design
- Solving Optimization Problems with Diseconomies of Scale via Decoupling
- Accelerating the Benders Decomposition Method: Application to Stochastic Network Design Problems
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency
- Oblivious Routing for the Lp-norm
- Mixing times and ℓp bounds for Oblivious routing
- Fibonacci heaps and their uses in improved network optimization algorithms
- Steiner Tree Approximation via Iterative Randomized Rounding
- Exact Price of Anarchy for Polynomial Congestion Games
This page was built for publication:
