Hallucination Helps: Energy Efficient Virtual Circuit Routing
From MaRDI portal
Publication:5210552
DOI10.1137/18M1228591zbMath1448.68178OpenAlexW3000297473WikidataQ126346314 ScholiaQ126346314MaRDI QIDQ5210552
Sungjin Im, Antonios Foivos Antoniadis, Benjamin Moseley, Ravishankar Krishnaswamy, Viswanath Nagarajan, Clifford Stein, Kirk R. Pruhs
Publication date: 21 January 2020
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/18m1228591
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Randomized algorithms (68W20) Network protocols (68M12) Online algorithms; streaming algorithms (68W27)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On fixed cost \(k\)-flow problems
- Best constants in moment inequalities for linear combinations of independent and exchangeable random variables
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
- The geometry of graphs and some of its algorithmic applications
- Packing directed circuits fractionally
- Improved bounds on the max-flow min-cut ratio for multicommodity flows
- On the subspaces of \(L^p\) \((p > 2)\) spanned by sequences of independent random variables
- Approximating the Single-Sink Link-Installation Problem in Network Design
- Random Sampling in Cut, Flow, and Network Design Problems
- Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling
- Capacitated Network Design on Undirected Graphs
- Divide-and-conquer approximation algorithms via spreading metrics
- Approximability of Capacitated Network Design
- Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- Minimum-Cost Network Design with (Dis)economies of Scale
- Approximation via cost sharing
- On Column-Restricted and Priority Covering Integer Programs
- Multicommodity flow, well-linked terminals, and routing problems
- Dynamic Steiner Tree Problem
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
- Online Buy-at-Bulk Network Design
- A General Approximation Technique for Constrained Forest Problems
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Multicast Routing for Energy Minimization Using Speed Scaling
- Hallucination Helps: Energy Efficient Virtual Circuit Routing
- Edge Disjoint Paths in Moderately Connected Graphs
- Graph partitioning using single commodity flows
