Hallucination helps: energy efficient virtual circuit routing
DOI10.1137/18M1228591zbMATH Open1448.68178OpenAlexW3000297473WikidataQ126346314 ScholiaQ126346314MaRDI QIDQ5210552FDOQ5210552
Authors: Antonios Foivos Antoniadis, Sungjin Im, Ravishankar Krishnaswamy, Benjamin Moseley, Viswanath Nagarajan, Kirk Pruhs, Clifford Stein 
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
Recommendations
- Hallucination helps: energy efficient virtual circuit routing
- Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing
- Multicast routing for energy minimization using speed scaling
- Energy-efficient scheduling and routing via randomized rounding
- Energy efficient scheduling and routing via randomized rounding
Online algorithms; streaming algorithms (68W27) Randomized algorithms (68W20) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Approximation algorithms (68W25) Network protocols (68M12)
Cites Work
- The geometry of graphs and some of its algorithmic applications
- On fixed cost \(k\)-flow problems
- Capacitated Network Design on Undirected Graphs
- Approximability of capacitated network design
- Title not available (Why is that?)
- On-line routing of virtual circuits with applications to load balancing and machine scheduling
- A General Approximation Technique for Constrained Forest Problems
- On the subspaces of \(L^p\) \((p > 2)\) spanned by sequences of independent random variables
- Title not available (Why is that?)
- Dynamic Steiner Tree Problem
- Best constants in moment inequalities for linear combinations of independent and exchangeable random variables
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
- Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
- Improved bounds on the max-flow min-cut ratio for multicommodity flows
- On column-restricted and priority covering integer programs
- Multicommodity flow, well-linked terminals, and routing problems
- Title not available (Why is that?)
- Divide-and-conquer approximation algorithms via spreading metrics
- Random sampling in cut, flow, and network design problems
- Approximation algorithms for nonuniform buy-at-bulk network design
- Packing directed circuits fractionally
- Approximation via cost sharing
- Approximating the single-sink link-installation problem in network design
- Online Primal-Dual for Non-linear Optimization with Applications to Speed Scaling
- Minimum-Cost Network Design with (Dis)economies of Scale
- An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
- Hallucination Helps: Energy Efficient Virtual Circuit Routing
- Edge Disjoint Paths in Moderately Connected Graphs
- Online Buy-at-Bulk Network Design
- Graph partitioning using single commodity flows
- Multicast routing for energy minimization using speed scaling
Cited In (2)
This page was built for publication: Hallucination helps: energy efficient virtual circuit routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5210552)
