Hallucination helps: energy efficient virtual circuit routing

DOI10.1137/18M1228591MaRDI QIDQ5210552zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

online algorithmsapproximation algorithmsenergy efficiencynetwork design

Mathematics Subject Classification ID

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)

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

Cites work

• scientific article; zbMATH DE number 1306871 (Why is no real title available?)
• scientific article; zbMATH DE number 1559550 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• A General Approximation Technique for Constrained Forest Problems
• An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
• An approximate max-flow min-cut relation for undirected multicommodity flow, with applications
• Approximability of capacitated network design
• Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
• Approximating the single-sink link-installation problem in network design
• Approximation algorithms for nonuniform buy-at-bulk network design
• Approximation via cost sharing
• Best constants in moment inequalities for linear combinations of independent and exchangeable random variables
• Capacitated network design on undirected graphs
• Divide-and-conquer approximation algorithms via spreading metrics
• Dynamic Steiner Tree Problem
• Edge Disjoint Paths in Moderately Connected Graphs
• Graph partitioning using single commodity flows
• Hallucination helps: energy efficient virtual circuit routing
• Improved bounds on the max-flow min-cut ratio for multicommodity flows
• Minimum-cost network design with (dis)economies of scale
• Multicast routing for energy minimization using speed scaling
• Multicommodity flow, well-linked terminals, and routing problems
• Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
• On column-restricted and priority covering integer programs
• On fixed cost k-flow problems
• On the subspaces of \(L^p\) \((p > 2)\) spanned by sequences of independent random variables
• On-line routing of virtual circuits with applications to load balancing and machine scheduling
• Online Buy-at-Bulk Network Design
• Online primal-dual for non-linear optimization with applications to speed scaling
• Packing directed circuits fractionally
• Random sampling in cut, flow, and network design problems
• The geometry of graphs and some of its algorithmic applications
• When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks

Cited in

(4)

• Hallucination helps: energy efficient virtual circuit routing
• Multicast routing for energy minimization using speed scaling
• Cluster before you hallucinate: approximating node-capacitated network design and energy efficient routing
• Cluster before you hallucinate: node-capacitated network design and energy efficient routing

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)